/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.06.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:38:56,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:38:56,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:38:56,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:38:56,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:38:56,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:38:56,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:38:56,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:38:56,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:38:56,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:38:56,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:38:56,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:38:56,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:38:56,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:38:56,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:38:56,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:38:56,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:38:56,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:38:56,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:38:56,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:38:56,402 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:38:56,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:38:56,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:38:56,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:38:56,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:38:56,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:38:56,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:38:56,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:38:56,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:38:56,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:38:56,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:38:56,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:38:56,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:38:56,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:38:56,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:38:56,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:38:56,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:38:56,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:38:56,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:38:56,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:38:56,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:38:56,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:38:56,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:38:56,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:38:56,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:38:56,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:38:56,426 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:38:56,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:38:56,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:38:56,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:38:56,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:38:56,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:38:56,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:38:56,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:38:56,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:38:56,428 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:38:56,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:38:56,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:38:56,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:38:56,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:38:56,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:38:56,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:38:56,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:38:56,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:38:56,428 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:38:56,429 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:38:56,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:38:56,429 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:38:56,429 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:38:56,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:38:56,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:38:56,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:38:56,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:38:56,635 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:38:56,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.06.i.cil-1.c [2022-04-08 08:38:56,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999f2a9da/8f2abe631b844c808a5bcfdc7eeaa90c/FLAG684854477 [2022-04-08 08:38:57,312 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:38:57,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.06.i.cil-1.c [2022-04-08 08:38:57,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999f2a9da/8f2abe631b844c808a5bcfdc7eeaa90c/FLAG684854477 [2022-04-08 08:38:57,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999f2a9da/8f2abe631b844c808a5bcfdc7eeaa90c [2022-04-08 08:38:57,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:38:57,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:38:57,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:38:57,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:38:57,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:38:57,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:38:57" (1/1) ... [2022-04-08 08:38:57,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633b20a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:57, skipping insertion in model container [2022-04-08 08:38:57,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:38:57" (1/1) ... [2022-04-08 08:38:57,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:38:57,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:38:57,981 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.06.i.cil-1.c[78520,78533] [2022-04-08 08:38:57,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:38:58,000 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:38:58,080 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.06.i.cil-1.c[78520,78533] [2022-04-08 08:38:58,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:38:58,107 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:38:58,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58 WrapperNode [2022-04-08 08:38:58,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:38:58,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:38:58,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:38:58,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:38:58,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58" (1/1) ... [2022-04-08 08:38:58,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58" (1/1) ... [2022-04-08 08:38:58,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58" (1/1) ... [2022-04-08 08:38:58,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58" (1/1) ... [2022-04-08 08:38:58,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58" (1/1) ... [2022-04-08 08:38:58,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58" (1/1) ... [2022-04-08 08:38:58,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58" (1/1) ... [2022-04-08 08:38:58,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:38:58,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:38:58,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:38:58,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:38:58,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58" (1/1) ... [2022-04-08 08:38:58,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:38:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:38:58,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:38:58,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:38:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:38:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:38:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:38:58,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:38:58,312 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:38:58,312 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:38:58,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:38:58,312 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:38:58,312 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:38:58,312 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:38:58,313 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:38:58,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:38:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:38:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:38:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:38:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:38:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:38:58,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:38:58,481 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:38:58,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:38:59,233 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:38:59,693 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:38:59,693 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:38:59,702 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:38:59,709 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:38:59,709 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:38:59,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:38:59 BoogieIcfgContainer [2022-04-08 08:38:59,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:38:59,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:38:59,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:38:59,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:38:59,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:38:57" (1/3) ... [2022-04-08 08:38:59,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3291cca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:38:59, skipping insertion in model container [2022-04-08 08:38:59,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:38:58" (2/3) ... [2022-04-08 08:38:59,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3291cca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:38:59, skipping insertion in model container [2022-04-08 08:38:59,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:38:59" (3/3) ... [2022-04-08 08:38:59,716 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-1.c [2022-04-08 08:38:59,719 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:38:59,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:38:59,748 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:38:59,752 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:38:59,753 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:38:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 161 states have (on average 1.7267080745341614) internal successors, (278), 162 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:38:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 08:38:59,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:59,778 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:38:59,778 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2054814794, now seen corresponding path program 1 times [2022-04-08 08:38:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:59,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [242070888] [2022-04-08 08:38:59,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:38:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2054814794, now seen corresponding path program 2 times [2022-04-08 08:38:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:59,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448467634] [2022-04-08 08:38:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:00,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:00,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {172#true} is VALID [2022-04-08 08:39:00,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-08 08:39:00,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172#true} {172#true} #750#return; {172#true} is VALID [2022-04-08 08:39:00,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {179#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:00,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {172#true} is VALID [2022-04-08 08:39:00,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-08 08:39:00,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} #750#return; {172#true} is VALID [2022-04-08 08:39:00,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} call #t~ret161 := main(); {172#true} is VALID [2022-04-08 08:39:00,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#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; {172#true} is VALID [2022-04-08 08:39:00,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {172#true} is VALID [2022-04-08 08:39:00,163 INFO L272 TraceCheckUtils]: 7: Hoare triple {172#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {172#true} is VALID [2022-04-08 08:39:00,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:00,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {177#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 08:39:00,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {178#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {173#false} is VALID [2022-04-08 08:39:00,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {173#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {173#false} is VALID [2022-04-08 08:39:00,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {173#false} assume !(9 == ~blastFlag~0); {173#false} is VALID [2022-04-08 08:39:00,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {173#false} assume !(12 == ~blastFlag~0); {173#false} is VALID [2022-04-08 08:39:00,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {173#false} assume !(15 == ~blastFlag~0); {173#false} is VALID [2022-04-08 08:39:00,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {173#false} assume !(18 == ~blastFlag~0); {173#false} is VALID [2022-04-08 08:39:00,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-08 08:39:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:39:00,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:00,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448467634] [2022-04-08 08:39:00,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448467634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:00,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:00,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:00,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:00,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [242070888] [2022-04-08 08:39:00,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [242070888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:00,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:00,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852628483] [2022-04-08 08:39:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:00,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 08:39:00,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:00,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:00,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:00,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:00,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:00,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:00,296 INFO L87 Difference]: Start difference. First operand has 169 states, 161 states have (on average 1.7267080745341614) internal successors, (278), 162 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:02,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:04,124 INFO L93 Difference]: Finished difference Result 461 states and 788 transitions. [2022-04-08 08:39:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:04,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-08 08:39:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 788 transitions. [2022-04-08 08:39:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 788 transitions. [2022-04-08 08:39:04,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 788 transitions. [2022-04-08 08:39:04,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 788 edges. 788 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:04,734 INFO L225 Difference]: With dead ends: 461 [2022-04-08 08:39:04,735 INFO L226 Difference]: Without dead ends: 281 [2022-04-08 08:39:04,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:39:04,740 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 172 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:04,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 529 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 554 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 08:39:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-08 08:39:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 193. [2022-04-08 08:39:04,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:04,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 193 states, 188 states have (on average 1.627659574468085) internal successors, (306), 188 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:04,780 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 193 states, 188 states have (on average 1.627659574468085) internal successors, (306), 188 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:04,780 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 193 states, 188 states have (on average 1.627659574468085) internal successors, (306), 188 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:04,793 INFO L93 Difference]: Finished difference Result 281 states and 439 transitions. [2022-04-08 08:39:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 439 transitions. [2022-04-08 08:39:04,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:04,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:04,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.627659574468085) internal successors, (306), 188 states have internal predecessors, (306), 3 states have call successors, (3), 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 281 states. [2022-04-08 08:39:04,801 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.627659574468085) internal successors, (306), 188 states have internal predecessors, (306), 3 states have call successors, (3), 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 281 states. [2022-04-08 08:39:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:04,812 INFO L93 Difference]: Finished difference Result 281 states and 439 transitions. [2022-04-08 08:39:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 439 transitions. [2022-04-08 08:39:04,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:04,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:04,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:04,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.627659574468085) internal successors, (306), 188 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 310 transitions. [2022-04-08 08:39:04,820 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 310 transitions. Word has length 51 [2022-04-08 08:39:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:04,821 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 310 transitions. [2022-04-08 08:39:04,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:04,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 310 transitions. [2022-04-08 08:39:05,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 310 transitions. [2022-04-08 08:39:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 08:39:05,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:05,031 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:05,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:39:05,031 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1754606550, now seen corresponding path program 1 times [2022-04-08 08:39:05,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:05,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1689421679] [2022-04-08 08:39:05,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:39:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1754606550, now seen corresponding path program 2 times [2022-04-08 08:39:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:05,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253210953] [2022-04-08 08:39:05,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:05,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:05,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {2061#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {2054#true} is VALID [2022-04-08 08:39:05,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {2054#true} assume true; {2054#true} is VALID [2022-04-08 08:39:05,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2054#true} {2054#true} #750#return; {2054#true} is VALID [2022-04-08 08:39:05,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {2054#true} call ULTIMATE.init(); {2061#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:05,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {2061#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {2054#true} is VALID [2022-04-08 08:39:05,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {2054#true} assume true; {2054#true} is VALID [2022-04-08 08:39:05,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2054#true} {2054#true} #750#return; {2054#true} is VALID [2022-04-08 08:39:05,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {2054#true} call #t~ret161 := main(); {2054#true} is VALID [2022-04-08 08:39:05,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {2054#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; {2054#true} is VALID [2022-04-08 08:39:05,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {2054#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2054#true} is VALID [2022-04-08 08:39:05,273 INFO L272 TraceCheckUtils]: 7: Hoare triple {2054#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2054#true} is VALID [2022-04-08 08:39:05,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {2054#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {2059#(= 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; {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {2059#(= 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; {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {2059#(= 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)))); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {2059#(= 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); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {2059#(= 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; {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {2059#(= 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); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {2059#(= 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); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {2059#(= 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); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {2059#(= 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); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {2059#(= 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); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {2059#(= 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); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {2059#(= 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); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {2059#(= 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); {2059#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:05,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {2059#(= 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); {2060#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:39:05,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {2060#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {2055#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {2055#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {2055#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {2055#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {2055#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {2055#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {2055#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {2055#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {2055#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {2055#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {2055#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {2055#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {2055#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {2055#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {2055#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {2055#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {2055#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {2055#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {2055#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {2055#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {2055#false} is VALID [2022-04-08 08:39:05,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {2055#false} assume 8641 == #t~mem76;havoc #t~mem76; {2055#false} is VALID [2022-04-08 08:39:05,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {2055#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2055#false} is VALID [2022-04-08 08:39:05,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {2055#false} assume !(9 == ~blastFlag~0); {2055#false} is VALID [2022-04-08 08:39:05,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {2055#false} assume !(12 == ~blastFlag~0); {2055#false} is VALID [2022-04-08 08:39:05,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {2055#false} assume !(15 == ~blastFlag~0); {2055#false} is VALID [2022-04-08 08:39:05,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {2055#false} assume !(18 == ~blastFlag~0); {2055#false} is VALID [2022-04-08 08:39:05,297 INFO L290 TraceCheckUtils]: 51: Hoare triple {2055#false} assume !false; {2055#false} is VALID [2022-04-08 08:39:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:39:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:05,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253210953] [2022-04-08 08:39:05,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253210953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:05,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:05,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:05,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:05,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1689421679] [2022-04-08 08:39:05,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1689421679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:05,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:05,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:05,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788496678] [2022-04-08 08:39:05,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:05,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 08:39:05,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:05,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:05,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:05,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:05,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:05,337 INFO L87 Difference]: Start difference. First operand 193 states and 310 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:06,711 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-08 08:39:12,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:13,200 INFO L93 Difference]: Finished difference Result 399 states and 642 transitions. [2022-04-08 08:39:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:13,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 08:39:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-04-08 08:39:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-04-08 08:39:13,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 496 transitions. [2022-04-08 08:39:13,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:13,544 INFO L225 Difference]: With dead ends: 399 [2022-04-08 08:39:13,545 INFO L226 Difference]: Without dead ends: 221 [2022-04-08 08:39:13,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:39:13,546 INFO L913 BasicCegarLoop]: 208 mSDtfsCounter, 22 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:13,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 547 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-08 08:39:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-08 08:39:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2022-04-08 08:39:13,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:13,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 204 states, 199 states have (on average 1.6331658291457287) internal successors, (325), 199 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,557 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 204 states, 199 states have (on average 1.6331658291457287) internal successors, (325), 199 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,557 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 204 states, 199 states have (on average 1.6331658291457287) internal successors, (325), 199 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:13,566 INFO L93 Difference]: Finished difference Result 221 states and 350 transitions. [2022-04-08 08:39:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 350 transitions. [2022-04-08 08:39:13,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:13,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:13,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 204 states, 199 states have (on average 1.6331658291457287) internal successors, (325), 199 states have internal predecessors, (325), 3 states have call successors, (3), 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 221 states. [2022-04-08 08:39:13,567 INFO L87 Difference]: Start difference. First operand has 204 states, 199 states have (on average 1.6331658291457287) internal successors, (325), 199 states have internal predecessors, (325), 3 states have call successors, (3), 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 221 states. [2022-04-08 08:39:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:13,576 INFO L93 Difference]: Finished difference Result 221 states and 350 transitions. [2022-04-08 08:39:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 350 transitions. [2022-04-08 08:39:13,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:13,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:13,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:13,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.6331658291457287) internal successors, (325), 199 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 329 transitions. [2022-04-08 08:39:13,585 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 329 transitions. Word has length 52 [2022-04-08 08:39:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:13,585 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 329 transitions. [2022-04-08 08:39:13,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 204 states and 329 transitions. [2022-04-08 08:39:13,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 329 edges. 329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 329 transitions. [2022-04-08 08:39:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:39:13,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:13,830 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:13,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:39:13,831 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1892555779, now seen corresponding path program 1 times [2022-04-08 08:39:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:13,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127408781] [2022-04-08 08:39:13,862 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:39:13,862 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:39:13,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1892555779, now seen corresponding path program 2 times [2022-04-08 08:39:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:13,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78966595] [2022-04-08 08:39:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:14,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {3721#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {3714#true} is VALID [2022-04-08 08:39:14,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {3714#true} assume true; {3714#true} is VALID [2022-04-08 08:39:14,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3714#true} {3714#true} #750#return; {3714#true} is VALID [2022-04-08 08:39:14,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {3714#true} call ULTIMATE.init(); {3721#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:14,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {3721#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {3714#true} is VALID [2022-04-08 08:39:14,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {3714#true} assume true; {3714#true} is VALID [2022-04-08 08:39:14,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3714#true} {3714#true} #750#return; {3714#true} is VALID [2022-04-08 08:39:14,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {3714#true} call #t~ret161 := main(); {3714#true} is VALID [2022-04-08 08:39:14,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {3714#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; {3714#true} is VALID [2022-04-08 08:39:14,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {3714#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3714#true} is VALID [2022-04-08 08:39:14,045 INFO L272 TraceCheckUtils]: 7: Hoare triple {3714#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3714#true} is VALID [2022-04-08 08:39:14,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {3714#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {3719#(= 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; {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {3719#(= 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; {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {3719#(= 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)))); {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {3719#(= 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); {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {3719#(= 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; {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {3719#(= 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); {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {3719#(= 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); {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {3719#(= 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); {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {3719#(= 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); {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {3719#(= 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); {3719#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:14,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {3719#(= 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); {3720#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-08 08:39:14,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {3720#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {3715#false} is VALID [2022-04-08 08:39:14,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {3715#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; {3715#false} is VALID [2022-04-08 08:39:14,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {3715#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); {3715#false} is VALID [2022-04-08 08:39:14,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {3715#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); {3715#false} is VALID [2022-04-08 08:39:14,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {3715#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3715#false} is VALID [2022-04-08 08:39:14,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {3715#false} ~skip~0 := 0; {3715#false} is VALID [2022-04-08 08:39:14,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {3715#false} assume !false; {3715#false} is VALID [2022-04-08 08:39:14,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {3715#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); {3715#false} is VALID [2022-04-08 08:39:14,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {3715#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {3715#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {3715#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {3715#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {3715#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {3715#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {3715#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {3715#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {3715#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {3715#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {3715#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {3715#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {3715#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {3715#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {3715#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {3715#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {3715#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {3715#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {3715#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {3715#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {3715#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {3715#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {3715#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {3715#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {3715#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {3715#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {3715#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {3715#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {3715#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {3715#false} is VALID [2022-04-08 08:39:14,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {3715#false} assume 8641 == #t~mem76;havoc #t~mem76; {3715#false} is VALID [2022-04-08 08:39:14,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {3715#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3715#false} is VALID [2022-04-08 08:39:14,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {3715#false} assume !(9 == ~blastFlag~0); {3715#false} is VALID [2022-04-08 08:39:14,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {3715#false} assume !(12 == ~blastFlag~0); {3715#false} is VALID [2022-04-08 08:39:14,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {3715#false} assume !(15 == ~blastFlag~0); {3715#false} is VALID [2022-04-08 08:39:14,057 INFO L290 TraceCheckUtils]: 63: Hoare triple {3715#false} assume !(18 == ~blastFlag~0); {3715#false} is VALID [2022-04-08 08:39:14,057 INFO L290 TraceCheckUtils]: 64: Hoare triple {3715#false} assume !false; {3715#false} is VALID [2022-04-08 08:39:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:39:14,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:14,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78966595] [2022-04-08 08:39:14,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78966595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:14,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:14,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:14,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:14,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127408781] [2022-04-08 08:39:14,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127408781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:14,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:14,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565052507] [2022-04-08 08:39:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:39:14,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:14,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:14,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:14,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:14,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:14,102 INFO L87 Difference]: Start difference. First operand 204 states and 329 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:18,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:20,429 INFO L93 Difference]: Finished difference Result 399 states and 641 transitions. [2022-04-08 08:39:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:20,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:39:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2022-04-08 08:39:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2022-04-08 08:39:20,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 495 transitions. [2022-04-08 08:39:20,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:20,776 INFO L225 Difference]: With dead ends: 399 [2022-04-08 08:39:20,776 INFO L226 Difference]: Without dead ends: 221 [2022-04-08 08:39:20,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:39:20,778 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 24 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:20,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 549 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 08:39:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-08 08:39:20,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2022-04-08 08:39:20,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:20,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 204 states, 199 states have (on average 1.6281407035175879) internal successors, (324), 199 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:20,787 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 204 states, 199 states have (on average 1.6281407035175879) internal successors, (324), 199 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:20,787 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 204 states, 199 states have (on average 1.6281407035175879) internal successors, (324), 199 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:20,791 INFO L93 Difference]: Finished difference Result 221 states and 349 transitions. [2022-04-08 08:39:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 349 transitions. [2022-04-08 08:39:20,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:20,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:20,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 204 states, 199 states have (on average 1.6281407035175879) internal successors, (324), 199 states have internal predecessors, (324), 3 states have call successors, (3), 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 221 states. [2022-04-08 08:39:20,793 INFO L87 Difference]: Start difference. First operand has 204 states, 199 states have (on average 1.6281407035175879) internal successors, (324), 199 states have internal predecessors, (324), 3 states have call successors, (3), 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 221 states. [2022-04-08 08:39:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:20,798 INFO L93 Difference]: Finished difference Result 221 states and 349 transitions. [2022-04-08 08:39:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 349 transitions. [2022-04-08 08:39:20,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:20,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:20,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:20,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.6281407035175879) internal successors, (324), 199 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 328 transitions. [2022-04-08 08:39:20,802 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 328 transitions. Word has length 65 [2022-04-08 08:39:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:20,802 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 328 transitions. [2022-04-08 08:39:20,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:20,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 204 states and 328 transitions. [2022-04-08 08:39:21,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 328 transitions. [2022-04-08 08:39:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:39:21,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:21,011 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:21,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:39:21,011 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2036186669, now seen corresponding path program 1 times [2022-04-08 08:39:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:21,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1874309973] [2022-04-08 08:39:21,065 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:39:21,065 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:39:21,065 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2036186669, now seen corresponding path program 2 times [2022-04-08 08:39:21,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:21,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31547044] [2022-04-08 08:39:21,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:21,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:21,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:21,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {5381#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {5374#true} is VALID [2022-04-08 08:39:21,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {5374#true} assume true; {5374#true} is VALID [2022-04-08 08:39:21,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5374#true} {5374#true} #750#return; {5374#true} is VALID [2022-04-08 08:39:21,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {5374#true} call ULTIMATE.init(); {5381#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:21,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {5381#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {5374#true} is VALID [2022-04-08 08:39:21,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {5374#true} assume true; {5374#true} is VALID [2022-04-08 08:39:21,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5374#true} {5374#true} #750#return; {5374#true} is VALID [2022-04-08 08:39:21,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {5374#true} call #t~ret161 := main(); {5374#true} is VALID [2022-04-08 08:39:21,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {5374#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; {5374#true} is VALID [2022-04-08 08:39:21,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {5374#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5374#true} is VALID [2022-04-08 08:39:21,169 INFO L272 TraceCheckUtils]: 7: Hoare triple {5374#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5374#true} is VALID [2022-04-08 08:39:21,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {5374#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:21,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {5379#(= 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; {5379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:21,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {5379#(= 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; {5379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:21,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {5379#(= 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)))); {5379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:21,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {5379#(= 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); {5379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:21,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {5379#(= 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; {5379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:21,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {5379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5379#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:21,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {5379#(= 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); {5380#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:39:21,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {5380#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {5375#false} is VALID [2022-04-08 08:39:21,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {5375#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {5375#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {5375#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5375#false} is VALID [2022-04-08 08:39:21,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {5375#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {5375#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); {5375#false} is VALID [2022-04-08 08:39:21,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {5375#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {5375#false} is VALID [2022-04-08 08:39:21,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {5375#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); {5375#false} is VALID [2022-04-08 08:39:21,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {5375#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); {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {5375#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); {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {5375#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {5375#false} ~skip~0 := 0; {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {5375#false} assume !false; {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {5375#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); {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {5375#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {5375#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {5375#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {5375#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {5375#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {5375#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {5375#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {5375#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 38: Hoare triple {5375#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {5375#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {5375#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {5375#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {5375#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {5375#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {5375#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {5375#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {5375#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 47: Hoare triple {5375#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 48: Hoare triple {5375#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {5375#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {5375#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {5375#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {5375#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {5375#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {5375#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {5375#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {5375#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {5375#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {5375#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 59: Hoare triple {5375#false} assume 8641 == #t~mem76;havoc #t~mem76; {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 60: Hoare triple {5375#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 61: Hoare triple {5375#false} assume !(9 == ~blastFlag~0); {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 62: Hoare triple {5375#false} assume !(12 == ~blastFlag~0); {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 63: Hoare triple {5375#false} assume !(15 == ~blastFlag~0); {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 64: Hoare triple {5375#false} assume !(18 == ~blastFlag~0); {5375#false} is VALID [2022-04-08 08:39:21,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {5375#false} assume !false; {5375#false} is VALID [2022-04-08 08:39:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:39:21,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:21,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31547044] [2022-04-08 08:39:21,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31547044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:21,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:21,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:21,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:21,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1874309973] [2022-04-08 08:39:21,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1874309973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:21,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:21,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884124371] [2022-04-08 08:39:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:21,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:39:21,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:21,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:21,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:21,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:21,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:21,229 INFO L87 Difference]: Start difference. First operand 204 states and 328 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:24,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:28,919 INFO L93 Difference]: Finished difference Result 398 states and 639 transitions. [2022-04-08 08:39:28,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:28,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:39:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-04-08 08:39:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-04-08 08:39:28,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 493 transitions. [2022-04-08 08:39:29,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:29,252 INFO L225 Difference]: With dead ends: 398 [2022-04-08 08:39:29,252 INFO L226 Difference]: Without dead ends: 220 [2022-04-08 08:39:29,252 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:39:29,253 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 28 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:29,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 551 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 08:39:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-04-08 08:39:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 204. [2022-04-08 08:39:29,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:29,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 204 states, 199 states have (on average 1.6231155778894473) internal successors, (323), 199 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:29,260 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 204 states, 199 states have (on average 1.6231155778894473) internal successors, (323), 199 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:29,260 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 204 states, 199 states have (on average 1.6231155778894473) internal successors, (323), 199 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:29,263 INFO L93 Difference]: Finished difference Result 220 states and 347 transitions. [2022-04-08 08:39:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 347 transitions. [2022-04-08 08:39:29,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:29,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:29,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 204 states, 199 states have (on average 1.6231155778894473) internal successors, (323), 199 states have internal predecessors, (323), 3 states have call successors, (3), 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 220 states. [2022-04-08 08:39:29,265 INFO L87 Difference]: Start difference. First operand has 204 states, 199 states have (on average 1.6231155778894473) internal successors, (323), 199 states have internal predecessors, (323), 3 states have call successors, (3), 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 220 states. [2022-04-08 08:39:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:29,268 INFO L93 Difference]: Finished difference Result 220 states and 347 transitions. [2022-04-08 08:39:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 347 transitions. [2022-04-08 08:39:29,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:29,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:29,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:29,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.6231155778894473) internal successors, (323), 199 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 327 transitions. [2022-04-08 08:39:29,272 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 327 transitions. Word has length 66 [2022-04-08 08:39:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:29,272 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 327 transitions. [2022-04-08 08:39:29,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:29,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 204 states and 327 transitions. [2022-04-08 08:39:29,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:29,548 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 327 transitions. [2022-04-08 08:39:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:39:29,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:29,550 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:29,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:39:29,550 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:29,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1420769855, now seen corresponding path program 1 times [2022-04-08 08:39:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:29,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621744064] [2022-04-08 08:39:29,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:39:29,719 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:39:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash 143606393, now seen corresponding path program 1 times [2022-04-08 08:39:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:29,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580492654] [2022-04-08 08:39:29,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:29,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:30,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {7039#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {7030#true} is VALID [2022-04-08 08:39:30,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {7030#true} assume true; {7030#true} is VALID [2022-04-08 08:39:30,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7030#true} {7030#true} #750#return; {7030#true} is VALID [2022-04-08 08:39:30,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {7030#true} call ULTIMATE.init(); {7039#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:30,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {7039#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {7030#true} is VALID [2022-04-08 08:39:30,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {7030#true} assume true; {7030#true} is VALID [2022-04-08 08:39:30,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7030#true} {7030#true} #750#return; {7030#true} is VALID [2022-04-08 08:39:30,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {7030#true} call #t~ret161 := main(); {7030#true} is VALID [2022-04-08 08:39:30,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {7030#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; {7030#true} is VALID [2022-04-08 08:39:30,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {7030#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7035#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-08 08:39:30,116 INFO L272 TraceCheckUtils]: 7: Hoare triple {7035#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7036#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-08 08:39:30,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {7036#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7037#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:39:30,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {7037#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 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; {7037#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:39:30,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {7037#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 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; {7037#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:39:30,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {7037#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7037#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:39:30,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {7037#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7038#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-08 08:39:30,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {7038#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {7031#false} is VALID [2022-04-08 08:39:30,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {7031#false} [756] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, 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_257|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, 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] {7031#false} is VALID [2022-04-08 08:39:30,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {7031#false} [755] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7031#false} is VALID [2022-04-08 08:39:30,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {7031#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); {7031#false} is VALID [2022-04-08 08:39:30,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {7031#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {7031#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {7031#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {7031#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {7031#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {7031#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {7031#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {7031#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {7031#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {7031#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {7031#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {7031#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {7031#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {7031#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {7031#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {7031#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {7031#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {7031#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {7031#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {7031#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {7031#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {7031#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {7031#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {7031#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {7031#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {7031#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {7031#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {7031#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {7031#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {7031#false} assume 8641 == #t~mem76;havoc #t~mem76; {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 47: Hoare triple {7031#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {7031#false} assume !(9 == ~blastFlag~0); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {7031#false} assume !(12 == ~blastFlag~0); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {7031#false} assume !(15 == ~blastFlag~0); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 51: Hoare triple {7031#false} assume !(18 == ~blastFlag~0); {7031#false} is VALID [2022-04-08 08:39:30,124 INFO L290 TraceCheckUtils]: 52: Hoare triple {7031#false} assume !false; {7031#false} is VALID [2022-04-08 08:39:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:39:30,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:30,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580492654] [2022-04-08 08:39:30,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580492654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:30,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:30,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:39:30,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:30,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621744064] [2022-04-08 08:39:30,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621744064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:30,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:30,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:39:30,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792051374] [2022-04-08 08:39:30,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:30,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:39:30,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:30,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:30,184 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-08 08:39:30,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:39:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:30,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:39:30,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:39:30,186 INFO L87 Difference]: Start difference. First operand 204 states and 327 transitions. Second operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:34,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:37,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:42,679 INFO L93 Difference]: Finished difference Result 401 states and 646 transitions. [2022-04-08 08:39:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:39:42,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:39:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 466 transitions. [2022-04-08 08:39:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 466 transitions. [2022-04-08 08:39:42,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 466 transitions. [2022-04-08 08:39:43,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:43,033 INFO L225 Difference]: With dead ends: 401 [2022-04-08 08:39:43,033 INFO L226 Difference]: Without dead ends: 204 [2022-04-08 08:39:43,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:39:43,034 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 7 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:43,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 951 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-04-08 08:39:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-04-08 08:39:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-04-08 08:39:43,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:43,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 204 states, 199 states have (on average 1.6180904522613064) internal successors, (322), 199 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:43,051 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 204 states, 199 states have (on average 1.6180904522613064) internal successors, (322), 199 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:43,052 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 204 states, 199 states have (on average 1.6180904522613064) internal successors, (322), 199 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:43,055 INFO L93 Difference]: Finished difference Result 204 states and 326 transitions. [2022-04-08 08:39:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 326 transitions. [2022-04-08 08:39:43,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:43,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:43,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 204 states, 199 states have (on average 1.6180904522613064) internal successors, (322), 199 states have internal predecessors, (322), 3 states have call successors, (3), 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 204 states. [2022-04-08 08:39:43,057 INFO L87 Difference]: Start difference. First operand has 204 states, 199 states have (on average 1.6180904522613064) internal successors, (322), 199 states have internal predecessors, (322), 3 states have call successors, (3), 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 204 states. [2022-04-08 08:39:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:43,077 INFO L93 Difference]: Finished difference Result 204 states and 326 transitions. [2022-04-08 08:39:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 326 transitions. [2022-04-08 08:39:43,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:43,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:43,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:43,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.6180904522613064) internal successors, (322), 199 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 326 transitions. [2022-04-08 08:39:43,082 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 326 transitions. Word has length 66 [2022-04-08 08:39:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:43,082 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 326 transitions. [2022-04-08 08:39:43,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:43,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 204 states and 326 transitions. [2022-04-08 08:39:43,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 326 transitions. [2022-04-08 08:39:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:39:43,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:43,347 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:43,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:39:43,347 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:43,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1218945921, now seen corresponding path program 1 times [2022-04-08 08:39:43,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:43,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1903667834] [2022-04-08 08:39:43,499 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:39:43,500 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:39:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1210758843, now seen corresponding path program 1 times [2022-04-08 08:39:43,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:43,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210047259] [2022-04-08 08:39:43,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:43,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:39:43,728 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:39:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:39:43,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:39:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1218945921, now seen corresponding path program 2 times [2022-04-08 08:39:43,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:43,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758892900] [2022-04-08 08:39:43,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:43,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:43,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {8673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {8666#true} is VALID [2022-04-08 08:39:43,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {8666#true} assume true; {8666#true} is VALID [2022-04-08 08:39:43,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8666#true} {8666#true} #750#return; {8666#true} is VALID [2022-04-08 08:39:43,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {8666#true} call ULTIMATE.init(); {8673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:43,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {8673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {8666#true} is VALID [2022-04-08 08:39:43,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {8666#true} assume true; {8666#true} is VALID [2022-04-08 08:39:43,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8666#true} {8666#true} #750#return; {8666#true} is VALID [2022-04-08 08:39:43,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {8666#true} call #t~ret161 := main(); {8666#true} is VALID [2022-04-08 08:39:43,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {8666#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; {8666#true} is VALID [2022-04-08 08:39:43,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {8666#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {8666#true} is VALID [2022-04-08 08:39:44,000 INFO L272 TraceCheckUtils]: 7: Hoare triple {8666#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8666#true} is VALID [2022-04-08 08:39:44,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {8666#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8671#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:44,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {8671#(= 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; {8671#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:44,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {8671#(= 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; {8671#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:44,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {8671#(= 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)))); {8671#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:44,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {8671#(= 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); {8671#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:44,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {8671#(= 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; {8671#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:44,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {8671#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {8671#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:44,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {8671#(= 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); {8671#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:44,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {8671#(= 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); {8672#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-08 08:39:44,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {8672#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {8667#false} is VALID [2022-04-08 08:39:44,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {8667#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {8667#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8667#false} is VALID [2022-04-08 08:39:44,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {8667#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {8667#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); {8667#false} is VALID [2022-04-08 08:39:44,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {8667#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8667#false} is VALID [2022-04-08 08:39:44,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {8667#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); {8667#false} is VALID [2022-04-08 08:39:44,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {8667#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); {8667#false} is VALID [2022-04-08 08:39:44,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {8667#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); {8667#false} is VALID [2022-04-08 08:39:44,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {8667#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8667#false} is VALID [2022-04-08 08:39:44,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {8667#false} ~skip~0 := 0; {8667#false} is VALID [2022-04-08 08:39:44,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {8667#false} assume !false; {8667#false} is VALID [2022-04-08 08:39:44,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {8667#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); {8667#false} is VALID [2022-04-08 08:39:44,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {8667#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {8667#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {8667#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {8667#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {8667#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {8667#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {8667#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {8667#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {8667#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {8667#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {8667#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {8667#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {8667#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {8667#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {8667#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {8667#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {8667#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {8667#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {8667#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {8667#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {8667#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {8667#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {8667#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {8667#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {8667#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 55: Hoare triple {8667#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {8667#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {8667#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,014 INFO L290 TraceCheckUtils]: 58: Hoare triple {8667#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {8667#false} is VALID [2022-04-08 08:39:44,014 INFO L290 TraceCheckUtils]: 59: Hoare triple {8667#false} assume 8641 == #t~mem76;havoc #t~mem76; {8667#false} is VALID [2022-04-08 08:39:44,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {8667#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {8667#false} is VALID [2022-04-08 08:39:44,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {8667#false} assume !(9 == ~blastFlag~0); {8667#false} is VALID [2022-04-08 08:39:44,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {8667#false} assume !(12 == ~blastFlag~0); {8667#false} is VALID [2022-04-08 08:39:44,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {8667#false} assume !(15 == ~blastFlag~0); {8667#false} is VALID [2022-04-08 08:39:44,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {8667#false} assume !(18 == ~blastFlag~0); {8667#false} is VALID [2022-04-08 08:39:44,015 INFO L290 TraceCheckUtils]: 65: Hoare triple {8667#false} assume !false; {8667#false} is VALID [2022-04-08 08:39:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:39:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:44,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758892900] [2022-04-08 08:39:44,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758892900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:44,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:44,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:44,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:44,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1903667834] [2022-04-08 08:39:44,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1903667834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:44,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:44,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912924630] [2022-04-08 08:39:44,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:44,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:39:44,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:44,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:44,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:44,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:44,068 INFO L87 Difference]: Start difference. First operand 204 states and 326 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:49,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:53,497 INFO L93 Difference]: Finished difference Result 398 states and 637 transitions. [2022-04-08 08:39:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:53,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:39:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2022-04-08 08:39:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2022-04-08 08:39:53,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 491 transitions. [2022-04-08 08:39:53,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:53,821 INFO L225 Difference]: With dead ends: 398 [2022-04-08 08:39:53,821 INFO L226 Difference]: Without dead ends: 220 [2022-04-08 08:39:53,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:39:53,822 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 26 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:53,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 549 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 381 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-08 08:39:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-04-08 08:39:53,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 204. [2022-04-08 08:39:53,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:53,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 204 states, 199 states have (on average 1.6130653266331658) internal successors, (321), 199 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:53,831 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 204 states, 199 states have (on average 1.6130653266331658) internal successors, (321), 199 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:53,831 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 204 states, 199 states have (on average 1.6130653266331658) internal successors, (321), 199 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:53,847 INFO L93 Difference]: Finished difference Result 220 states and 345 transitions. [2022-04-08 08:39:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 345 transitions. [2022-04-08 08:39:53,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:53,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:53,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 204 states, 199 states have (on average 1.6130653266331658) internal successors, (321), 199 states have internal predecessors, (321), 3 states have call successors, (3), 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 220 states. [2022-04-08 08:39:53,851 INFO L87 Difference]: Start difference. First operand has 204 states, 199 states have (on average 1.6130653266331658) internal successors, (321), 199 states have internal predecessors, (321), 3 states have call successors, (3), 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 220 states. [2022-04-08 08:39:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:53,855 INFO L93 Difference]: Finished difference Result 220 states and 345 transitions. [2022-04-08 08:39:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 345 transitions. [2022-04-08 08:39:53,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:53,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:53,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:53,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.6130653266331658) internal successors, (321), 199 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 325 transitions. [2022-04-08 08:39:53,864 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 325 transitions. Word has length 66 [2022-04-08 08:39:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:53,864 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 325 transitions. [2022-04-08 08:39:53,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:53,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 204 states and 325 transitions. [2022-04-08 08:39:54,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 325 transitions. [2022-04-08 08:39:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:39:54,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:54,164 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:54,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2022-04-08 08:39:54,164 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 855769654, now seen corresponding path program 1 times [2022-04-08 08:39:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:54,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285098860] [2022-04-08 08:39:54,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:39:54,181 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:39:54,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash 855769654, now seen corresponding path program 2 times [2022-04-08 08:39:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:54,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350301450] [2022-04-08 08:39:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:54,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:54,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {10329#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {10322#true} is VALID [2022-04-08 08:39:54,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-08 08:39:54,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10322#true} {10322#true} #750#return; {10322#true} is VALID [2022-04-08 08:39:54,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {10322#true} call ULTIMATE.init(); {10329#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:54,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {10329#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {10322#true} is VALID [2022-04-08 08:39:54,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-08 08:39:54,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10322#true} {10322#true} #750#return; {10322#true} is VALID [2022-04-08 08:39:54,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {10322#true} call #t~ret161 := main(); {10322#true} is VALID [2022-04-08 08:39:54,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {10322#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; {10322#true} is VALID [2022-04-08 08:39:54,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {10322#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {10322#true} is VALID [2022-04-08 08:39:54,310 INFO L272 TraceCheckUtils]: 7: Hoare triple {10322#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10322#true} is VALID [2022-04-08 08:39:54,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {10322#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {10327#(= 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; {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {10327#(= 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; {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {10327#(= 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)))); {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {10327#(= 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); {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {10327#(= 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; {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {10327#(= 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); {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {10327#(= 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); {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {10327#(= 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); {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {10327#(= 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); {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {10327#(= 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); {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {10327#(= 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); {10327#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:54,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {10327#(= 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); {10328#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-08 08:39:54,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {10328#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {10323#false} is VALID [2022-04-08 08:39:54,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {10323#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; {10323#false} is VALID [2022-04-08 08:39:54,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {10323#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); {10323#false} is VALID [2022-04-08 08:39:54,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {10323#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); {10323#false} is VALID [2022-04-08 08:39:54,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {10323#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10323#false} is VALID [2022-04-08 08:39:54,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {10323#false} ~skip~0 := 0; {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {10323#false} assume !false; {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {10323#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); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {10323#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {10323#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {10323#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {10323#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {10323#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {10323#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {10323#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {10323#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {10323#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {10323#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {10323#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {10323#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {10323#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {10323#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {10323#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {10323#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {10323#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {10323#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {10323#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {10323#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {10323#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {10323#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {10323#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {10323#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {10323#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {10323#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {10323#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {10323#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {10323#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {10323#false} assume 8641 == #t~mem76;havoc #t~mem76; {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {10323#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {10323#false} assume !(9 == ~blastFlag~0); {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {10323#false} assume !(12 == ~blastFlag~0); {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {10323#false} assume !(15 == ~blastFlag~0); {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 64: Hoare triple {10323#false} assume !(18 == ~blastFlag~0); {10323#false} is VALID [2022-04-08 08:39:54,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {10323#false} assume !false; {10323#false} is VALID [2022-04-08 08:39:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:39:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:54,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350301450] [2022-04-08 08:39:54,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350301450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:54,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:54,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:54,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:54,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285098860] [2022-04-08 08:39:54,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285098860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:54,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:54,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955645970] [2022-04-08 08:39:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:54,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:39:54,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:54,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:54,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:54,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:54,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:54,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:54,372 INFO L87 Difference]: Start difference. First operand 204 states and 325 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:58,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:03,625 INFO L93 Difference]: Finished difference Result 396 states and 634 transitions. [2022-04-08 08:40:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:03,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:40:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-08 08:40:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-08 08:40:03,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 488 transitions. [2022-04-08 08:40:03,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:03,991 INFO L225 Difference]: With dead ends: 396 [2022-04-08 08:40:03,991 INFO L226 Difference]: Without dead ends: 218 [2022-04-08 08:40:03,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:03,992 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 20 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:03,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 553 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 08:40:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-08 08:40:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 204. [2022-04-08 08:40:03,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:04,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 204 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 199 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:04,000 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 204 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 199 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:04,000 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 204 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 199 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:04,005 INFO L93 Difference]: Finished difference Result 218 states and 342 transitions. [2022-04-08 08:40:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 342 transitions. [2022-04-08 08:40:04,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:04,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:04,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 204 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 199 states have internal predecessors, (320), 3 states have call successors, (3), 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 218 states. [2022-04-08 08:40:04,007 INFO L87 Difference]: Start difference. First operand has 204 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 199 states have internal predecessors, (320), 3 states have call successors, (3), 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 218 states. [2022-04-08 08:40:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:04,010 INFO L93 Difference]: Finished difference Result 218 states and 342 transitions. [2022-04-08 08:40:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 342 transitions. [2022-04-08 08:40:04,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:04,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:04,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:04,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 199 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 324 transitions. [2022-04-08 08:40:04,017 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 324 transitions. Word has length 66 [2022-04-08 08:40:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:04,017 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 324 transitions. [2022-04-08 08:40:04,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:04,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 204 states and 324 transitions. [2022-04-08 08:40:04,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 324 transitions. [2022-04-08 08:40:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:40:04,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:04,165 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:04,166 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:40:04,166 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1356421175, now seen corresponding path program 1 times [2022-04-08 08:40:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:04,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152867520] [2022-04-08 08:40:04,176 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:40:04,176 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:40:04,176 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1356421175, now seen corresponding path program 2 times [2022-04-08 08:40:04,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:04,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503814056] [2022-04-08 08:40:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:04,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:04,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {11977#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {11970#true} is VALID [2022-04-08 08:40:04,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {11970#true} assume true; {11970#true} is VALID [2022-04-08 08:40:04,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11970#true} {11970#true} #750#return; {11970#true} is VALID [2022-04-08 08:40:04,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {11970#true} call ULTIMATE.init(); {11977#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:04,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {11977#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {11970#true} is VALID [2022-04-08 08:40:04,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {11970#true} assume true; {11970#true} is VALID [2022-04-08 08:40:04,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11970#true} {11970#true} #750#return; {11970#true} is VALID [2022-04-08 08:40:04,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {11970#true} call #t~ret161 := main(); {11970#true} is VALID [2022-04-08 08:40:04,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {11970#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; {11970#true} is VALID [2022-04-08 08:40:04,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {11970#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {11970#true} is VALID [2022-04-08 08:40:04,274 INFO L272 TraceCheckUtils]: 7: Hoare triple {11970#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11970#true} is VALID [2022-04-08 08:40:04,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {11970#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:04,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {11975#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11976#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {11976#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {11971#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {11971#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); {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {11971#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {11971#false} ~skip~0 := 0; {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {11971#false} assume !false; {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {11971#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); {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {11971#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {11971#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {11971#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {11971#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {11971#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {11971#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {11971#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {11971#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {11971#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {11971#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {11971#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {11971#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {11971#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {11971#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {11971#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {11971#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {11971#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {11971#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {11971#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {11971#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {11971#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {11971#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {11971#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {11971#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {11971#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {11971#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {11971#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 57: Hoare triple {11971#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 58: Hoare triple {11971#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 59: Hoare triple {11971#false} assume 8641 == #t~mem76;havoc #t~mem76; {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 60: Hoare triple {11971#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {11971#false} assume !(9 == ~blastFlag~0); {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {11971#false} assume !(12 == ~blastFlag~0); {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 63: Hoare triple {11971#false} assume !(15 == ~blastFlag~0); {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 64: Hoare triple {11971#false} assume !(18 == ~blastFlag~0); {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {11971#false} assume !false; {11971#false} is VALID [2022-04-08 08:40:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:04,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:04,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503814056] [2022-04-08 08:40:04,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503814056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:04,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:04,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:04,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:04,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152867520] [2022-04-08 08:40:04,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152867520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:04,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:04,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:04,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475681168] [2022-04-08 08:40:04,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:40:04,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:04,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:04,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:04,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:04,337 INFO L87 Difference]: Start difference. First operand 204 states and 324 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:13,075 INFO L93 Difference]: Finished difference Result 508 states and 816 transitions. [2022-04-08 08:40:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:13,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:40:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2022-04-08 08:40:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2022-04-08 08:40:13,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 655 transitions. [2022-04-08 08:40:13,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 655 edges. 655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:13,539 INFO L225 Difference]: With dead ends: 508 [2022-04-08 08:40:13,539 INFO L226 Difference]: Without dead ends: 330 [2022-04-08 08:40:13,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:13,540 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 161 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:13,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 410 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:40:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-04-08 08:40:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 222. [2022-04-08 08:40:13,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:13,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 222 states, 217 states have (on average 1.6036866359447004) internal successors, (348), 217 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:13,555 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 222 states, 217 states have (on average 1.6036866359447004) internal successors, (348), 217 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:13,558 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 222 states, 217 states have (on average 1.6036866359447004) internal successors, (348), 217 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:13,564 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2022-04-08 08:40:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 522 transitions. [2022-04-08 08:40:13,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:13,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:13,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.6036866359447004) internal successors, (348), 217 states have internal predecessors, (348), 3 states have call successors, (3), 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 330 states. [2022-04-08 08:40:13,565 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.6036866359447004) internal successors, (348), 217 states have internal predecessors, (348), 3 states have call successors, (3), 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 330 states. [2022-04-08 08:40:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:13,571 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2022-04-08 08:40:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 522 transitions. [2022-04-08 08:40:13,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:13,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:13,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:13,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.6036866359447004) internal successors, (348), 217 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 352 transitions. [2022-04-08 08:40:13,575 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 352 transitions. Word has length 66 [2022-04-08 08:40:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:13,575 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 352 transitions. [2022-04-08 08:40:13,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:13,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 352 transitions. [2022-04-08 08:40:13,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 352 transitions. [2022-04-08 08:40:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:40:13,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:13,798 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:13,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:40:13,798 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1890776424, now seen corresponding path program 1 times [2022-04-08 08:40:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:13,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1232154033] [2022-04-08 08:40:13,962 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:40:13,962 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:40:13,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1663967621, now seen corresponding path program 1 times [2022-04-08 08:40:13,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:13,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334358539] [2022-04-08 08:40:13,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:40:14,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:40:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:40:14,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:40:14,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1890776424, now seen corresponding path program 2 times [2022-04-08 08:40:14,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:14,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805312863] [2022-04-08 08:40:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:14,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {14109#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {14102#true} is VALID [2022-04-08 08:40:14,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {14102#true} assume true; {14102#true} is VALID [2022-04-08 08:40:14,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14102#true} {14102#true} #750#return; {14102#true} is VALID [2022-04-08 08:40:14,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {14102#true} call ULTIMATE.init(); {14109#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:14,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {14109#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {14102#true} is VALID [2022-04-08 08:40:14,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {14102#true} assume true; {14102#true} is VALID [2022-04-08 08:40:14,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14102#true} {14102#true} #750#return; {14102#true} is VALID [2022-04-08 08:40:14,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {14102#true} call #t~ret161 := main(); {14102#true} is VALID [2022-04-08 08:40:14,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {14102#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; {14102#true} is VALID [2022-04-08 08:40:14,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {14102#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {14102#true} is VALID [2022-04-08 08:40:14,385 INFO L272 TraceCheckUtils]: 7: Hoare triple {14102#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14102#true} is VALID [2022-04-08 08:40:14,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {14102#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:14,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:14,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:14,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:14,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:14,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:14,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:14,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:14,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:40:14,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {14107#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14108#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-08 08:40:14,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {14108#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {14103#false} is VALID [2022-04-08 08:40:14,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {14103#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {14103#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {14103#false} is VALID [2022-04-08 08:40:14,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {14103#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {14103#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); {14103#false} is VALID [2022-04-08 08:40:14,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {14103#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {14103#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); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {14103#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); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {14103#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); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {14103#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {14103#false} ~skip~0 := 0; {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {14103#false} assume !false; {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {14103#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); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {14103#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {14103#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {14103#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {14103#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {14103#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {14103#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {14103#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {14103#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {14103#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {14103#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {14103#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {14103#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {14103#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {14103#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {14103#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {14103#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {14103#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {14103#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {14103#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {14103#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {14103#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,394 INFO L290 TraceCheckUtils]: 52: Hoare triple {14103#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {14103#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {14103#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,394 INFO L290 TraceCheckUtils]: 55: Hoare triple {14103#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,394 INFO L290 TraceCheckUtils]: 56: Hoare triple {14103#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {14103#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {14103#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {14103#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {14103#false} is VALID [2022-04-08 08:40:14,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {14103#false} assume 8641 == #t~mem76;havoc #t~mem76; {14103#false} is VALID [2022-04-08 08:40:14,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {14103#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14103#false} is VALID [2022-04-08 08:40:14,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {14103#false} assume !(9 == ~blastFlag~0); {14103#false} is VALID [2022-04-08 08:40:14,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {14103#false} assume !(12 == ~blastFlag~0); {14103#false} is VALID [2022-04-08 08:40:14,396 INFO L290 TraceCheckUtils]: 64: Hoare triple {14103#false} assume !(15 == ~blastFlag~0); {14103#false} is VALID [2022-04-08 08:40:14,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {14103#false} assume !(18 == ~blastFlag~0); {14103#false} is VALID [2022-04-08 08:40:14,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {14103#false} assume !false; {14103#false} is VALID [2022-04-08 08:40:14,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:14,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:14,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805312863] [2022-04-08 08:40:14,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805312863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:14,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:14,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:14,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:14,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1232154033] [2022-04-08 08:40:14,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1232154033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:14,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:14,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:14,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818612461] [2022-04-08 08:40:14,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:40:14,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:14,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:14,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:14,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:14,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:14,450 INFO L87 Difference]: Start difference. First operand 222 states and 352 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:22,276 INFO L93 Difference]: Finished difference Result 526 states and 842 transitions. [2022-04-08 08:40:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:22,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:40:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-04-08 08:40:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-04-08 08:40:22,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 654 transitions. [2022-04-08 08:40:22,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 654 edges. 654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:22,753 INFO L225 Difference]: With dead ends: 526 [2022-04-08 08:40:22,753 INFO L226 Difference]: Without dead ends: 330 [2022-04-08 08:40:22,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:22,754 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 165 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:22,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 410 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-08 08:40:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-04-08 08:40:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 222. [2022-04-08 08:40:22,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:22,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 222 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 217 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:22,761 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 222 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 217 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:22,761 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 222 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 217 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:22,767 INFO L93 Difference]: Finished difference Result 330 states and 519 transitions. [2022-04-08 08:40:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 519 transitions. [2022-04-08 08:40:22,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:22,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:22,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 217 states have internal predecessors, (345), 3 states have call successors, (3), 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 330 states. [2022-04-08 08:40:22,768 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 217 states have internal predecessors, (345), 3 states have call successors, (3), 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 330 states. [2022-04-08 08:40:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:22,774 INFO L93 Difference]: Finished difference Result 330 states and 519 transitions. [2022-04-08 08:40:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 519 transitions. [2022-04-08 08:40:22,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:22,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:22,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:22,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 217 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 349 transitions. [2022-04-08 08:40:22,779 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 349 transitions. Word has length 67 [2022-04-08 08:40:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:22,779 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 349 transitions. [2022-04-08 08:40:22,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:22,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 349 transitions. [2022-04-08 08:40:23,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 349 transitions. [2022-04-08 08:40:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:40:23,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:23,014 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:23,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2022-04-08 08:40:23,015 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash -530875484, now seen corresponding path program 1 times [2022-04-08 08:40:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:23,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542560834] [2022-04-08 08:40:23,149 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:40:23,150 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:40:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash -243726789, now seen corresponding path program 1 times [2022-04-08 08:40:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:23,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80485507] [2022-04-08 08:40:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:40:23,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:40:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:40:23,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:40:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -530875484, now seen corresponding path program 2 times [2022-04-08 08:40:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:23,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519647541] [2022-04-08 08:40:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:23,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {16277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {16270#true} is VALID [2022-04-08 08:40:23,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {16270#true} assume true; {16270#true} is VALID [2022-04-08 08:40:23,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16270#true} {16270#true} #750#return; {16270#true} is VALID [2022-04-08 08:40:23,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {16270#true} call ULTIMATE.init(); {16277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:23,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {16277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {16270#true} is VALID [2022-04-08 08:40:23,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {16270#true} assume true; {16270#true} is VALID [2022-04-08 08:40:23,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16270#true} {16270#true} #750#return; {16270#true} is VALID [2022-04-08 08:40:23,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {16270#true} call #t~ret161 := main(); {16270#true} is VALID [2022-04-08 08:40:23,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {16270#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; {16270#true} is VALID [2022-04-08 08:40:23,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {16270#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {16270#true} is VALID [2022-04-08 08:40:23,489 INFO L272 TraceCheckUtils]: 7: Hoare triple {16270#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16270#true} is VALID [2022-04-08 08:40:23,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {16270#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {16275#(= 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; {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {16275#(= 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; {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {16275#(= 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)))); {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {16275#(= 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); {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {16275#(= 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; {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {16275#(= 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); {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {16275#(= 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); {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {16275#(= 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); {16275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:23,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {16275#(= 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); {16276#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {16276#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {16271#false} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {16271#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {16271#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16271#false} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {16271#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {16271#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); {16271#false} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {16271#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16271#false} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {16271#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); {16271#false} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {16271#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); {16271#false} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {16271#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); {16271#false} is VALID [2022-04-08 08:40:23,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {16271#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {16271#false} ~skip~0 := 0; {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {16271#false} assume !false; {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {16271#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); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {16271#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {16271#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {16271#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {16271#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {16271#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {16271#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {16271#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {16271#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {16271#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {16271#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {16271#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {16271#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {16271#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {16271#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {16271#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 47: Hoare triple {16271#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {16271#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {16271#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {16271#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 51: Hoare triple {16271#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 52: Hoare triple {16271#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {16271#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {16271#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 55: Hoare triple {16271#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,498 INFO L290 TraceCheckUtils]: 56: Hoare triple {16271#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {16271#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {16271#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {16271#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {16271#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {16271#false} assume 8641 == #t~mem76;havoc #t~mem76; {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {16271#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {16271#false} assume !(9 == ~blastFlag~0); {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 64: Hoare triple {16271#false} assume !(12 == ~blastFlag~0); {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {16271#false} assume !(15 == ~blastFlag~0); {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {16271#false} assume !(18 == ~blastFlag~0); {16271#false} is VALID [2022-04-08 08:40:23,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {16271#false} assume !false; {16271#false} is VALID [2022-04-08 08:40:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:23,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519647541] [2022-04-08 08:40:23,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519647541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:23,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:23,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:23,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:23,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542560834] [2022-04-08 08:40:23,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542560834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:23,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:23,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638582372] [2022-04-08 08:40:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:23,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:40:23,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:23,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:23,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:23,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:23,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:23,556 INFO L87 Difference]: Start difference. First operand 222 states and 349 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:31,537 INFO L93 Difference]: Finished difference Result 431 states and 684 transitions. [2022-04-08 08:40:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:31,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:40:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-08 08:40:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-08 08:40:31,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 484 transitions. [2022-04-08 08:40:31,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:31,850 INFO L225 Difference]: With dead ends: 431 [2022-04-08 08:40:31,850 INFO L226 Difference]: Without dead ends: 235 [2022-04-08 08:40:31,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:31,851 INFO L913 BasicCegarLoop]: 212 mSDtfsCounter, 20 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:31,851 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 555 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 08:40:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-08 08:40:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 222. [2022-04-08 08:40:31,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:31,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 222 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 217 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,857 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 222 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 217 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,857 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 222 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 217 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:31,860 INFO L93 Difference]: Finished difference Result 235 states and 365 transitions. [2022-04-08 08:40:31,860 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 365 transitions. [2022-04-08 08:40:31,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:31,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:31,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 217 states have internal predecessors, (344), 3 states have call successors, (3), 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 235 states. [2022-04-08 08:40:31,861 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 217 states have internal predecessors, (344), 3 states have call successors, (3), 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 235 states. [2022-04-08 08:40:31,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:31,864 INFO L93 Difference]: Finished difference Result 235 states and 365 transitions. [2022-04-08 08:40:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 365 transitions. [2022-04-08 08:40:31,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:31,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:31,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:31,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 217 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 348 transitions. [2022-04-08 08:40:31,868 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 348 transitions. Word has length 68 [2022-04-08 08:40:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:31,869 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 348 transitions. [2022-04-08 08:40:31,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:31,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 348 transitions. [2022-04-08 08:40:32,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 348 transitions. [2022-04-08 08:40:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 08:40:32,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:32,112 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:32,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2022-04-08 08:40:32,112 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1668529901, now seen corresponding path program 1 times [2022-04-08 08:40:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:32,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [141891427] [2022-04-08 08:40:32,287 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:40:32,288 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:40:32,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1176514043, now seen corresponding path program 1 times [2022-04-08 08:40:32,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:32,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971083336] [2022-04-08 08:40:32,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:40:32,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:40:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:40:32,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:40:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1668529901, now seen corresponding path program 2 times [2022-04-08 08:40:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:32,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788789375] [2022-04-08 08:40:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:32,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {18065#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {18058#true} is VALID [2022-04-08 08:40:32,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {18058#true} assume true; {18058#true} is VALID [2022-04-08 08:40:32,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18058#true} {18058#true} #750#return; {18058#true} is VALID [2022-04-08 08:40:32,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {18058#true} call ULTIMATE.init(); {18065#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:32,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {18065#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {18058#true} is VALID [2022-04-08 08:40:32,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {18058#true} assume true; {18058#true} is VALID [2022-04-08 08:40:32,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18058#true} {18058#true} #750#return; {18058#true} is VALID [2022-04-08 08:40:32,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {18058#true} call #t~ret161 := main(); {18058#true} is VALID [2022-04-08 08:40:32,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {18058#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; {18058#true} is VALID [2022-04-08 08:40:32,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {18058#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {18058#true} is VALID [2022-04-08 08:40:32,628 INFO L272 TraceCheckUtils]: 7: Hoare triple {18058#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18058#true} is VALID [2022-04-08 08:40:32,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {18058#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {18063#(= 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; {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {18063#(= 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; {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {18063#(= 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)))); {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {18063#(= 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); {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {18063#(= 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; {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {18063#(= 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); {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {18063#(= 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); {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {18063#(= 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); {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {18063#(= 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); {18063#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:32,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {18063#(= 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); {18064#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-08 08:40:32,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {18064#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {18059#false} is VALID [2022-04-08 08:40:32,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {18059#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {18059#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18059#false} is VALID [2022-04-08 08:40:32,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {18059#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {18059#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); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {18059#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {18059#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); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {18059#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); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {18059#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); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {18059#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {18059#false} ~skip~0 := 0; {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {18059#false} assume !false; {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {18059#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); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {18059#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {18059#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {18059#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {18059#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {18059#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {18059#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {18059#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {18059#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {18059#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {18059#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {18059#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {18059#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {18059#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {18059#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {18059#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {18059#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {18059#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {18059#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,636 INFO L290 TraceCheckUtils]: 51: Hoare triple {18059#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {18059#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {18059#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {18059#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 55: Hoare triple {18059#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {18059#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {18059#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {18059#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 59: Hoare triple {18059#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 60: Hoare triple {18059#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {18059#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {18059#false} assume 8641 == #t~mem76;havoc #t~mem76; {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 63: Hoare triple {18059#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 64: Hoare triple {18059#false} assume !(9 == ~blastFlag~0); {18059#false} is VALID [2022-04-08 08:40:32,637 INFO L290 TraceCheckUtils]: 65: Hoare triple {18059#false} assume !(12 == ~blastFlag~0); {18059#false} is VALID [2022-04-08 08:40:32,638 INFO L290 TraceCheckUtils]: 66: Hoare triple {18059#false} assume !(15 == ~blastFlag~0); {18059#false} is VALID [2022-04-08 08:40:32,638 INFO L290 TraceCheckUtils]: 67: Hoare triple {18059#false} assume !(18 == ~blastFlag~0); {18059#false} is VALID [2022-04-08 08:40:32,638 INFO L290 TraceCheckUtils]: 68: Hoare triple {18059#false} assume !false; {18059#false} is VALID [2022-04-08 08:40:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:32,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:32,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788789375] [2022-04-08 08:40:32,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788789375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:32,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:32,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:32,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:32,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [141891427] [2022-04-08 08:40:32,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [141891427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:32,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:32,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:32,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014996526] [2022-04-08 08:40:32,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:32,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:40:32,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:32,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:32,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:32,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:32,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:32,707 INFO L87 Difference]: Start difference. First operand 222 states and 348 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:35,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:37,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:39,870 INFO L93 Difference]: Finished difference Result 421 states and 670 transitions. [2022-04-08 08:40:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:39,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:40:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-08 08:40:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-08 08:40:39,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 470 transitions. [2022-04-08 08:40:40,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:40,185 INFO L225 Difference]: With dead ends: 421 [2022-04-08 08:40:40,185 INFO L226 Difference]: Without dead ends: 225 [2022-04-08 08:40:40,186 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:40,186 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 11 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:40,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 569 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 08:40:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-08 08:40:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2022-04-08 08:40:40,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:40,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 222 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:40,192 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 222 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:40,192 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 222 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:40,195 INFO L93 Difference]: Finished difference Result 225 states and 351 transitions. [2022-04-08 08:40:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 351 transitions. [2022-04-08 08:40:40,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:40,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:40,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 3 states have call successors, (3), 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 225 states. [2022-04-08 08:40:40,196 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 3 states have call successors, (3), 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 225 states. [2022-04-08 08:40:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:40,198 INFO L93 Difference]: Finished difference Result 225 states and 351 transitions. [2022-04-08 08:40:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 351 transitions. [2022-04-08 08:40:40,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:40,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:40,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:40,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 347 transitions. [2022-04-08 08:40:40,202 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 347 transitions. Word has length 69 [2022-04-08 08:40:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:40,202 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 347 transitions. [2022-04-08 08:40:40,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:40,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 347 transitions. [2022-04-08 08:40:40,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 347 transitions. [2022-04-08 08:40:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 08:40:40,444 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:40,444 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:40,444 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2022-04-08 08:40:40,444 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:40,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 367940822, now seen corresponding path program 1 times [2022-04-08 08:40:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:40,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623417425] [2022-04-08 08:40:40,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:40:40,460 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:40:40,460 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:40,460 INFO L85 PathProgramCache]: Analyzing trace with hash 367940822, now seen corresponding path program 2 times [2022-04-08 08:40:40,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:40,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264440545] [2022-04-08 08:40:40,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:40,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:40,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:40,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {19813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {19806#true} is VALID [2022-04-08 08:40:40,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {19806#true} assume true; {19806#true} is VALID [2022-04-08 08:40:40,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19806#true} {19806#true} #750#return; {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {19806#true} call ULTIMATE.init(); {19813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {19813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {19806#true} assume true; {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19806#true} {19806#true} #750#return; {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {19806#true} call #t~ret161 := main(); {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {19806#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; {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {19806#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L272 TraceCheckUtils]: 7: Hoare triple {19806#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {19806#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {19806#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; {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {19806#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; {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {19806#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {19806#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {19806#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {19806#true} assume !false; {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {19806#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); {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {19806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {19806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {19806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {19806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {19806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {19806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {19806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {19806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {19806#true} assume 8464 == #t~mem55;havoc #t~mem55; {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {19806#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; {19806#true} is VALID [2022-04-08 08:40:40,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {19806#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19806#true} is VALID [2022-04-08 08:40:40,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {19806#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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {19811#(= 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; {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {19811#(= 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); {19811#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:40,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {19811#(= 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); {19812#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {19812#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {19807#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {19807#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {19807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {19807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 49: Hoare triple {19807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 50: Hoare triple {19807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 51: Hoare triple {19807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 52: Hoare triple {19807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 53: Hoare triple {19807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 54: Hoare triple {19807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 55: Hoare triple {19807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {19807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {19807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 58: Hoare triple {19807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 59: Hoare triple {19807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 60: Hoare triple {19807#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 61: Hoare triple {19807#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 62: Hoare triple {19807#false} assume 8641 == #t~mem76;havoc #t~mem76; {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 63: Hoare triple {19807#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 64: Hoare triple {19807#false} assume !(9 == ~blastFlag~0); {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {19807#false} assume !(12 == ~blastFlag~0); {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {19807#false} assume !(15 == ~blastFlag~0); {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 67: Hoare triple {19807#false} assume !(18 == ~blastFlag~0); {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L290 TraceCheckUtils]: 68: Hoare triple {19807#false} assume !false; {19807#false} is VALID [2022-04-08 08:40:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:40,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:40,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264440545] [2022-04-08 08:40:40,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264440545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:40,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:40,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:40,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:40,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623417425] [2022-04-08 08:40:40,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623417425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:40,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:40,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342537820] [2022-04-08 08:40:40,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:40,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:40:40,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:40,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:40,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:40,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:40,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:40,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:40,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:40,646 INFO L87 Difference]: Start difference. First operand 222 states and 347 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:42,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:44,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:47,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:48,300 INFO L93 Difference]: Finished difference Result 460 states and 728 transitions. [2022-04-08 08:40:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:40:48,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2022-04-08 08:40:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2022-04-08 08:40:48,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 517 transitions. [2022-04-08 08:40:48,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:48,630 INFO L225 Difference]: With dead ends: 460 [2022-04-08 08:40:48,630 INFO L226 Difference]: Without dead ends: 264 [2022-04-08 08:40:48,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:48,631 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 32 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:48,631 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 569 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-08 08:40:48,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-08 08:40:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 244. [2022-04-08 08:40:48,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:48,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 244 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 239 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,659 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 244 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 239 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,660 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 244 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 239 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:48,663 INFO L93 Difference]: Finished difference Result 264 states and 409 transitions. [2022-04-08 08:40:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 409 transitions. [2022-04-08 08:40:48,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:48,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:48,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 239 states have internal predecessors, (379), 3 states have call successors, (3), 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 264 states. [2022-04-08 08:40:48,664 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 239 states have internal predecessors, (379), 3 states have call successors, (3), 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 264 states. [2022-04-08 08:40:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:48,667 INFO L93 Difference]: Finished difference Result 264 states and 409 transitions. [2022-04-08 08:40:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 409 transitions. [2022-04-08 08:40:48,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:48,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:48,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:48,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 239 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 383 transitions. [2022-04-08 08:40:48,671 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 383 transitions. Word has length 69 [2022-04-08 08:40:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:48,671 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 383 transitions. [2022-04-08 08:40:48,672 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 383 transitions. [2022-04-08 08:40:48,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 383 transitions. [2022-04-08 08:40:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 08:40:48,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:48,936 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:48,936 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:40:48,936 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1614587139, now seen corresponding path program 1 times [2022-04-08 08:40:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070151715] [2022-04-08 08:40:48,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:40:48,966 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:40:48,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1614587139, now seen corresponding path program 2 times [2022-04-08 08:40:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:48,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649916933] [2022-04-08 08:40:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:49,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {21761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {21754#true} is VALID [2022-04-08 08:40:49,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {21754#true} assume true; {21754#true} is VALID [2022-04-08 08:40:49,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21754#true} {21754#true} #750#return; {21754#true} is VALID [2022-04-08 08:40:49,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {21754#true} call ULTIMATE.init(); {21761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:49,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {21761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {21754#true} is VALID [2022-04-08 08:40:49,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {21754#true} assume true; {21754#true} is VALID [2022-04-08 08:40:49,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21754#true} {21754#true} #750#return; {21754#true} is VALID [2022-04-08 08:40:49,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {21754#true} call #t~ret161 := main(); {21754#true} is VALID [2022-04-08 08:40:49,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {21754#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; {21754#true} is VALID [2022-04-08 08:40:49,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {21754#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {21754#true} is VALID [2022-04-08 08:40:49,086 INFO L272 TraceCheckUtils]: 7: Hoare triple {21754#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21754#true} is VALID [2022-04-08 08:40:49,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {21754#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {21754#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; {21754#true} is VALID [2022-04-08 08:40:49,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {21754#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; {21754#true} is VALID [2022-04-08 08:40:49,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {21754#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21754#true} is VALID [2022-04-08 08:40:49,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {21754#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {21754#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {21754#true} is VALID [2022-04-08 08:40:49,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {21754#true} assume !false; {21754#true} is VALID [2022-04-08 08:40:49,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {21754#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); {21754#true} is VALID [2022-04-08 08:40:49,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {21754#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {21754#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {21754#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {21754#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {21754#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {21754#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {21754#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {21754#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21754#true} is VALID [2022-04-08 08:40:49,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {21754#true} assume 8464 == #t~mem55;havoc #t~mem55; {21754#true} is VALID [2022-04-08 08:40:49,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {21754#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; {21754#true} is VALID [2022-04-08 08:40:49,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {21754#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21754#true} is VALID [2022-04-08 08:40:49,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {21754#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); {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {21759#(= 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); {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {21759#(= 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; {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {21759#(= 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); {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {21759#(= 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); {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {21759#(= 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); {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {21759#(= 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); {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {21759#(= 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); {21759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:49,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {21759#(= 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); {21760#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-08 08:40:49,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {21760#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {21755#false} is VALID [2022-04-08 08:40:49,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {21755#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; {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {21755#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); {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {21755#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); {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {21755#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {21755#false} ~skip~0 := 0; {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {21755#false} assume !false; {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {21755#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); {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {21755#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {21755#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {21755#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {21755#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {21755#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {21755#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {21755#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {21755#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {21755#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {21755#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {21755#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {21755#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {21755#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 59: Hoare triple {21755#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 60: Hoare triple {21755#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 61: Hoare triple {21755#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 62: Hoare triple {21755#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 63: Hoare triple {21755#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 64: Hoare triple {21755#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 65: Hoare triple {21755#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,100 INFO L290 TraceCheckUtils]: 66: Hoare triple {21755#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 67: Hoare triple {21755#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 68: Hoare triple {21755#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 69: Hoare triple {21755#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 70: Hoare triple {21755#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 71: Hoare triple {21755#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 72: Hoare triple {21755#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 73: Hoare triple {21755#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 74: Hoare triple {21755#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 75: Hoare triple {21755#false} assume 8641 == #t~mem76;havoc #t~mem76; {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 76: Hoare triple {21755#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {21755#false} assume !(9 == ~blastFlag~0); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {21755#false} assume !(12 == ~blastFlag~0); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 79: Hoare triple {21755#false} assume !(15 == ~blastFlag~0); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 80: Hoare triple {21755#false} assume !(18 == ~blastFlag~0); {21755#false} is VALID [2022-04-08 08:40:49,101 INFO L290 TraceCheckUtils]: 81: Hoare triple {21755#false} assume !false; {21755#false} is VALID [2022-04-08 08:40:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:40:49,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649916933] [2022-04-08 08:40:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649916933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:49,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:49,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:49,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070151715] [2022-04-08 08:40:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070151715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:49,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:49,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:49,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406142401] [2022-04-08 08:40:49,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-08 08:40:49,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:49,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:49,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:49,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:49,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:49,162 INFO L87 Difference]: Start difference. First operand 244 states and 383 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:50,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:52,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:55,974 INFO L93 Difference]: Finished difference Result 482 states and 763 transitions. [2022-04-08 08:40:55,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:55,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-08 08:40:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2022-04-08 08:40:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2022-04-08 08:40:55,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 516 transitions. [2022-04-08 08:40:56,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 516 edges. 516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:56,303 INFO L225 Difference]: With dead ends: 482 [2022-04-08 08:40:56,303 INFO L226 Difference]: Without dead ends: 264 [2022-04-08 08:40:56,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:56,304 INFO L913 BasicCegarLoop]: 217 mSDtfsCounter, 37 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:56,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 569 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-08 08:40:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-08 08:40:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 244. [2022-04-08 08:40:56,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:56,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 244 states, 239 states have (on average 1.5815899581589958) internal successors, (378), 239 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:56,310 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 244 states, 239 states have (on average 1.5815899581589958) internal successors, (378), 239 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:56,310 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 244 states, 239 states have (on average 1.5815899581589958) internal successors, (378), 239 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:56,313 INFO L93 Difference]: Finished difference Result 264 states and 408 transitions. [2022-04-08 08:40:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 408 transitions. [2022-04-08 08:40:56,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:56,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:56,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.5815899581589958) internal successors, (378), 239 states have internal predecessors, (378), 3 states have call successors, (3), 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 264 states. [2022-04-08 08:40:56,314 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.5815899581589958) internal successors, (378), 239 states have internal predecessors, (378), 3 states have call successors, (3), 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 264 states. [2022-04-08 08:40:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:56,318 INFO L93 Difference]: Finished difference Result 264 states and 408 transitions. [2022-04-08 08:40:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 408 transitions. [2022-04-08 08:40:56,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:56,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:56,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:56,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.5815899581589958) internal successors, (378), 239 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 382 transitions. [2022-04-08 08:40:56,322 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 382 transitions. Word has length 82 [2022-04-08 08:40:56,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:56,322 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 382 transitions. [2022-04-08 08:40:56,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:56,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 382 transitions. [2022-04-08 08:40:56,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:56,591 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 382 transitions. [2022-04-08 08:40:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 08:40:56,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:56,592 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:56,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:40:56,592 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2063279917, now seen corresponding path program 1 times [2022-04-08 08:40:56,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:56,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [354483339] [2022-04-08 08:40:56,623 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:40:56,623 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:40:56,623 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:56,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2063279917, now seen corresponding path program 2 times [2022-04-08 08:40:56,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:56,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915756174] [2022-04-08 08:40:56,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:56,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:56,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:56,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {23753#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {23746#true} is VALID [2022-04-08 08:40:56,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {23746#true} assume true; {23746#true} is VALID [2022-04-08 08:40:56,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23746#true} {23746#true} #750#return; {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {23746#true} call ULTIMATE.init(); {23753#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:40:56,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {23753#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {23746#true} assume true; {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23746#true} {23746#true} #750#return; {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {23746#true} call #t~ret161 := main(); {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {23746#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; {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {23746#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L272 TraceCheckUtils]: 7: Hoare triple {23746#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {23746#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {23746#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; {23746#true} is VALID [2022-04-08 08:40:56,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {23746#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; {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {23746#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {23746#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {23746#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {23746#true} assume !false; {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {23746#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); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {23746#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {23746#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {23746#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {23746#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {23746#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {23746#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {23746#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {23746#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {23746#true} assume 8464 == #t~mem55;havoc #t~mem55; {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {23746#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; {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {23746#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {23746#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); {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {23746#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {23746#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {23746#true} ~skip~0 := 0; {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {23746#true} assume !false; {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {23746#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); {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {23746#true} assume 12292 == #t~mem47;havoc #t~mem47; {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {23746#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {23746#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {23746#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {23746#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {23746#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {23746#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {23746#true} is VALID [2022-04-08 08:40:56,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {23746#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {23746#true} is VALID [2022-04-08 08:40:56,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {23746#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:40:56,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {23751#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23752#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 08:40:56,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {23752#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {23747#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {23747#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {23747#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {23747#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {23747#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {23747#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {23747#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {23747#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {23747#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {23747#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {23747#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {23747#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 65: Hoare triple {23747#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 66: Hoare triple {23747#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 67: Hoare triple {23747#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {23747#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {23747#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {23747#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {23747#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {23747#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {23747#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {23747#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {23747#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {23747#false} assume 8641 == #t~mem76;havoc #t~mem76; {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {23747#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 78: Hoare triple {23747#false} assume !(9 == ~blastFlag~0); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 79: Hoare triple {23747#false} assume !(12 == ~blastFlag~0); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 80: Hoare triple {23747#false} assume !(15 == ~blastFlag~0); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {23747#false} assume !(18 == ~blastFlag~0); {23747#false} is VALID [2022-04-08 08:40:56,732 INFO L290 TraceCheckUtils]: 82: Hoare triple {23747#false} assume !false; {23747#false} is VALID [2022-04-08 08:40:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:40:56,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:56,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915756174] [2022-04-08 08:40:56,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915756174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:56,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:56,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:56,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:56,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [354483339] [2022-04-08 08:40:56,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [354483339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:56,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:56,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:56,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650472039] [2022-04-08 08:40:56,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 08:40:56,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:56,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:56,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:56,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:56,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:56,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:56,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:56,793 INFO L87 Difference]: Start difference. First operand 244 states and 382 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:59,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:03,813 INFO L93 Difference]: Finished difference Result 491 states and 777 transitions. [2022-04-08 08:41:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 08:41:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-04-08 08:41:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-04-08 08:41:03,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 496 transitions. [2022-04-08 08:41:04,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:04,088 INFO L225 Difference]: With dead ends: 491 [2022-04-08 08:41:04,088 INFO L226 Difference]: Without dead ends: 273 [2022-04-08 08:41:04,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:04,090 INFO L913 BasicCegarLoop]: 252 mSDtfsCounter, 21 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:04,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 640 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:41:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-08 08:41:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 260. [2022-04-08 08:41:04,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:04,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 260 states, 255 states have (on average 1.580392156862745) internal successors, (403), 255 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:04,099 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 260 states, 255 states have (on average 1.580392156862745) internal successors, (403), 255 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:04,099 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 260 states, 255 states have (on average 1.580392156862745) internal successors, (403), 255 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:04,102 INFO L93 Difference]: Finished difference Result 273 states and 423 transitions. [2022-04-08 08:41:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 423 transitions. [2022-04-08 08:41:04,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:04,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:04,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 255 states have (on average 1.580392156862745) internal successors, (403), 255 states have internal predecessors, (403), 3 states have call successors, (3), 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 273 states. [2022-04-08 08:41:04,103 INFO L87 Difference]: Start difference. First operand has 260 states, 255 states have (on average 1.580392156862745) internal successors, (403), 255 states have internal predecessors, (403), 3 states have call successors, (3), 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 273 states. [2022-04-08 08:41:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:04,106 INFO L93 Difference]: Finished difference Result 273 states and 423 transitions. [2022-04-08 08:41:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 423 transitions. [2022-04-08 08:41:04,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:04,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:04,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:04,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 255 states have (on average 1.580392156862745) internal successors, (403), 255 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 407 transitions. [2022-04-08 08:41:04,111 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 407 transitions. Word has length 83 [2022-04-08 08:41:04,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:04,111 INFO L478 AbstractCegarLoop]: Abstraction has 260 states and 407 transitions. [2022-04-08 08:41:04,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:04,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 260 states and 407 transitions. [2022-04-08 08:41:04,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 407 transitions. [2022-04-08 08:41:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 08:41:04,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:04,420 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:04,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:41:04,421 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:04,421 INFO L85 PathProgramCache]: Analyzing trace with hash 681038968, now seen corresponding path program 1 times [2022-04-08 08:41:04,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:04,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [235399104] [2022-04-08 08:41:04,451 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:04,451 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:04,451 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash 681038968, now seen corresponding path program 2 times [2022-04-08 08:41:04,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:04,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014291057] [2022-04-08 08:41:04,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:04,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:04,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {25813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {25806#true} is VALID [2022-04-08 08:41:04,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {25806#true} assume true; {25806#true} is VALID [2022-04-08 08:41:04,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25806#true} {25806#true} #750#return; {25806#true} is VALID [2022-04-08 08:41:04,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {25806#true} call ULTIMATE.init(); {25813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:41:04,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {25813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {25806#true} is VALID [2022-04-08 08:41:04,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {25806#true} assume true; {25806#true} is VALID [2022-04-08 08:41:04,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25806#true} {25806#true} #750#return; {25806#true} is VALID [2022-04-08 08:41:04,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {25806#true} call #t~ret161 := main(); {25806#true} is VALID [2022-04-08 08:41:04,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {25806#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; {25806#true} is VALID [2022-04-08 08:41:04,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {25806#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L272 TraceCheckUtils]: 7: Hoare triple {25806#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {25806#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {25806#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; {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {25806#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; {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {25806#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {25806#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {25806#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {25806#true} assume !false; {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {25806#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); {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {25806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {25806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {25806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {25806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {25806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {25806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {25806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {25806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25806#true} is VALID [2022-04-08 08:41:04,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {25806#true} assume 8464 == #t~mem55;havoc #t~mem55; {25806#true} is VALID [2022-04-08 08:41:04,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {25806#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; {25806#true} is VALID [2022-04-08 08:41:04,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {25806#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25806#true} is VALID [2022-04-08 08:41:04,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {25806#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); {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:41:04,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {25811#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25812#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 08:41:04,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {25812#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {25807#false} is VALID [2022-04-08 08:41:04,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {25807#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; {25807#false} is VALID [2022-04-08 08:41:04,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {25807#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); {25807#false} is VALID [2022-04-08 08:41:04,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {25807#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); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 43: Hoare triple {25807#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {25807#false} ~skip~0 := 0; {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {25807#false} assume !false; {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {25807#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); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {25807#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {25807#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {25807#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {25807#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 51: Hoare triple {25807#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 52: Hoare triple {25807#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {25807#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 54: Hoare triple {25807#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,555 INFO L290 TraceCheckUtils]: 55: Hoare triple {25807#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {25807#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {25807#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {25807#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {25807#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {25807#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {25807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {25807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {25807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {25807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {25807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 66: Hoare triple {25807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 67: Hoare triple {25807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 68: Hoare triple {25807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 69: Hoare triple {25807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,556 INFO L290 TraceCheckUtils]: 70: Hoare triple {25807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 71: Hoare triple {25807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 72: Hoare triple {25807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 73: Hoare triple {25807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 74: Hoare triple {25807#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 75: Hoare triple {25807#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 76: Hoare triple {25807#false} assume 8641 == #t~mem76;havoc #t~mem76; {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 77: Hoare triple {25807#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 78: Hoare triple {25807#false} assume !(9 == ~blastFlag~0); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 79: Hoare triple {25807#false} assume !(12 == ~blastFlag~0); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 80: Hoare triple {25807#false} assume !(15 == ~blastFlag~0); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 81: Hoare triple {25807#false} assume !(18 == ~blastFlag~0); {25807#false} is VALID [2022-04-08 08:41:04,557 INFO L290 TraceCheckUtils]: 82: Hoare triple {25807#false} assume !false; {25807#false} is VALID [2022-04-08 08:41:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:41:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:04,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014291057] [2022-04-08 08:41:04,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014291057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:04,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:04,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:04,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:04,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [235399104] [2022-04-08 08:41:04,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [235399104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:04,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:04,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106608426] [2022-04-08 08:41:04,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:04,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 08:41:04,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:04,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:04,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:04,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:04,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:04,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:04,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:04,619 INFO L87 Difference]: Start difference. First operand 260 states and 407 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:11,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:41:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:12,544 INFO L93 Difference]: Finished difference Result 602 states and 955 transitions. [2022-04-08 08:41:12,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:12,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 08:41:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-04-08 08:41:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-04-08 08:41:12,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 653 transitions. [2022-04-08 08:41:12,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 653 edges. 653 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:12,959 INFO L225 Difference]: With dead ends: 602 [2022-04-08 08:41:12,959 INFO L226 Difference]: Without dead ends: 368 [2022-04-08 08:41:12,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:12,960 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 161 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:12,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 410 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-08 08:41:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-08 08:41:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 260. [2022-04-08 08:41:12,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:12,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 260 states, 255 states have (on average 1.5686274509803921) internal successors, (400), 255 states have internal predecessors, (400), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:12,967 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 260 states, 255 states have (on average 1.5686274509803921) internal successors, (400), 255 states have internal predecessors, (400), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:12,967 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 260 states, 255 states have (on average 1.5686274509803921) internal successors, (400), 255 states have internal predecessors, (400), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:12,972 INFO L93 Difference]: Finished difference Result 368 states and 574 transitions. [2022-04-08 08:41:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 574 transitions. [2022-04-08 08:41:12,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:12,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:12,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 255 states have (on average 1.5686274509803921) internal successors, (400), 255 states have internal predecessors, (400), 3 states have call successors, (3), 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 368 states. [2022-04-08 08:41:12,973 INFO L87 Difference]: Start difference. First operand has 260 states, 255 states have (on average 1.5686274509803921) internal successors, (400), 255 states have internal predecessors, (400), 3 states have call successors, (3), 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 368 states. [2022-04-08 08:41:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:12,979 INFO L93 Difference]: Finished difference Result 368 states and 574 transitions. [2022-04-08 08:41:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 574 transitions. [2022-04-08 08:41:12,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:12,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:12,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:12,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 255 states have (on average 1.5686274509803921) internal successors, (400), 255 states have internal predecessors, (400), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 404 transitions. [2022-04-08 08:41:12,983 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 404 transitions. Word has length 83 [2022-04-08 08:41:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:12,983 INFO L478 AbstractCegarLoop]: Abstraction has 260 states and 404 transitions. [2022-04-08 08:41:12,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:12,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 260 states and 404 transitions. [2022-04-08 08:41:13,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 404 transitions. [2022-04-08 08:41:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 08:41:13,191 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:13,191 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:13,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:41:13,191 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:13,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:13,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1678762034, now seen corresponding path program 1 times [2022-04-08 08:41:13,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:13,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1513897950] [2022-04-08 08:41:13,307 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 17 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:41:13,308 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:41:13,308 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:41:13,308 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 08:41:13,312 INFO L158 Benchmark]: Toolchain (without parser) took 135625.12ms. Allocated memory was 270.5MB in the beginning and 325.1MB in the end (delta: 54.5MB). Free memory was 244.7MB in the beginning and 153.2MB in the end (delta: 91.5MB). Peak memory consumption was 146.2MB. Max. memory is 8.0GB. [2022-04-08 08:41:13,312 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:41:13,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.32ms. Allocated memory is still 270.5MB. Free memory was 244.7MB in the beginning and 217.5MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-04-08 08:41:13,313 INFO L158 Benchmark]: Boogie Preprocessor took 92.28ms. Allocated memory is still 270.5MB. Free memory was 217.5MB in the beginning and 207.6MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 08:41:13,313 INFO L158 Benchmark]: RCFGBuilder took 1509.37ms. Allocated memory is still 270.5MB. Free memory was 207.6MB in the beginning and 183.2MB in the end (delta: 24.4MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. [2022-04-08 08:41:13,313 INFO L158 Benchmark]: TraceAbstraction took 133599.77ms. Allocated memory was 270.5MB in the beginning and 325.1MB in the end (delta: 54.5MB). Free memory was 182.7MB in the beginning and 153.2MB in the end (delta: 29.6MB). Peak memory consumption was 84.1MB. Max. memory is 8.0GB. [2022-04-08 08:41:13,315 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 176.2MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.32ms. Allocated memory is still 270.5MB. Free memory was 244.7MB in the beginning and 217.5MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 92.28ms. Allocated memory is still 270.5MB. Free memory was 217.5MB in the beginning and 207.6MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1509.37ms. Allocated memory is still 270.5MB. Free memory was 207.6MB in the beginning and 183.2MB in the end (delta: 24.4MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. * TraceAbstraction took 133599.77ms. Allocated memory was 270.5MB in the beginning and 325.1MB in the end (delta: 54.5MB). Free memory was 182.7MB in the beginning and 153.2MB in the end (delta: 29.6MB). Peak memory consumption was 84.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 08:41:13,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...