/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:22:14,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:22:14,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:22:14,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:22:14,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:22:14,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:22:14,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:22:14,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:22:14,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:22:14,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:22:14,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:22:14,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:22:14,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:22:14,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:22:14,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:22:14,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:22:14,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:22:14,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:22:14,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:22:14,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:22:14,429 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:22:14,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:22:14,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:22:14,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:22:14,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:22:14,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:22:14,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:22:14,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:22:14,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:22:14,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:22:14,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:22:14,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:22:14,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:22:14,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:22:14,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:22:14,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:22:14,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:22:14,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:22:14,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:22:14,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:22:14,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:22:14,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:22:14,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:22:14,471 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:22:14,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:22:14,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:22:14,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:22:14,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:22:14,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:22:14,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:22:14,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:22:14,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:22:14,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:22:14,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:22:14,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:22:14,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:22:14,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:22:14,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:22:14,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:22:14,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:22:14,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:22:14,475 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:22:14,475 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:22:14,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:22:14,475 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:22:14,475 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 18:22:14,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:22:14,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:22:14,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:22:14,684 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:22:14,687 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:22:14,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c [2022-04-15 18:22:14,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76bfdfa97/c22addd8046346188af250c38886d4b9/FLAG5d8e6542b [2022-04-15 18:22:15,112 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:22:15,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c [2022-04-15 18:22:15,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76bfdfa97/c22addd8046346188af250c38886d4b9/FLAG5d8e6542b [2022-04-15 18:22:15,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76bfdfa97/c22addd8046346188af250c38886d4b9 [2022-04-15 18:22:15,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:22:15,459 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:22:15,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:22:15,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:22:15,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:22:15,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:15,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604a68fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15, skipping insertion in model container [2022-04-15 18:22:15,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:15,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:22:15,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:22:15,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c[75833,75846] [2022-04-15 18:22:15,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:22:15,813 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:22:15,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c[75833,75846] [2022-04-15 18:22:15,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:22:15,937 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:22:15,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15 WrapperNode [2022-04-15 18:22:15,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:22:15,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:22:15,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:22:15,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:22:15,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:15,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:15,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:15,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:16,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:16,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:16,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:16,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:22:16,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:22:16,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:22:16,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:22:16,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15" (1/1) ... [2022-04-15 18:22:16,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:22:16,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:22:16,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 18:22:16,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 18:22:16,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:22:16,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:22:16,106 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:22:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 18:22:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 18:22:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:22:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 18:22:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 18:22:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 18:22:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 18:22:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:22:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:22:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:22:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:22:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 18:22:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:22:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:22:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:22:16,255 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:22:16,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:22:16,753 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:22:17,223 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 18:22:17,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 18:22:17,231 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:22:17,237 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:22:17,238 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:22:17,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:22:17 BoogieIcfgContainer [2022-04-15 18:22:17,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:22:17,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:22:17,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:22:17,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:22:17,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:22:15" (1/3) ... [2022-04-15 18:22:17,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adf9931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:22:17, skipping insertion in model container [2022-04-15 18:22:17,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:22:15" (2/3) ... [2022-04-15 18:22:17,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adf9931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:22:17, skipping insertion in model container [2022-04-15 18:22:17,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:22:17" (3/3) ... [2022-04-15 18:22:17,244 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-2.c [2022-04-15 18:22:17,247 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:22:17,247 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:22:17,272 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:22:17,276 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 18:22:17,276 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:22:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 155 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 18:22:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 18:22:17,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:22:17,298 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:22:17,298 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:22:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:22:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash -668377608, now seen corresponding path program 1 times [2022-04-15 18:22:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:17,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [266742998] [2022-04-15 18:22:17,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:22:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash -668377608, now seen corresponding path program 2 times [2022-04-15 18:22:17,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:22:17,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146091939] [2022-04-15 18:22:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:22:17,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:22:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:22:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:17,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165#true} is VALID [2022-04-15 18:22:17,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-15 18:22:17,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #708#return; {165#true} is VALID [2022-04-15 18:22:17,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:22:17,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165#true} is VALID [2022-04-15 18:22:17,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-15 18:22:17,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #708#return; {165#true} is VALID [2022-04-15 18:22:17,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret161 := main(); {165#true} is VALID [2022-04-15 18:22:17,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {165#true} is VALID [2022-04-15 18:22:17,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {165#true} is VALID [2022-04-15 18:22:17,766 INFO L272 TraceCheckUtils]: 7: Hoare triple {165#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {165#true} is VALID [2022-04-15 18:22:17,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:17,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {171#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 18:22:17,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {171#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {166#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {166#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {166#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {166#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {166#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {166#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {166#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {166#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {166#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {166#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,787 INFO L290 TraceCheckUtils]: 43: Hoare triple {166#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {166#false} is VALID [2022-04-15 18:22:17,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {166#false} assume 8640 == #t~mem75;havoc #t~mem75; {166#false} is VALID [2022-04-15 18:22:17,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {166#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {166#false} is VALID [2022-04-15 18:22:17,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {166#false} assume !(4 == ~blastFlag~0); {166#false} is VALID [2022-04-15 18:22:17,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {166#false} assume !(7 == ~blastFlag~0); {166#false} is VALID [2022-04-15 18:22:17,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {166#false} assume !(10 == ~blastFlag~0); {166#false} is VALID [2022-04-15 18:22:17,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {166#false} assume 13 == ~blastFlag~0; {166#false} is VALID [2022-04-15 18:22:17,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-04-15 18:22:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:22:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:22:17,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146091939] [2022-04-15 18:22:17,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146091939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:17,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:17,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:17,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:22:17,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [266742998] [2022-04-15 18:22:17,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [266742998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:17,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:17,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893486942] [2022-04-15 18:22:17,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:22:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 18:22:17,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:22:17,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:17,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:17,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:22:17,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:17,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:22:17,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:22:17,884 INFO L87 Difference]: Start difference. First operand has 162 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 155 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:25,387 INFO L93 Difference]: Finished difference Result 342 states and 576 transitions. [2022-04-15 18:22:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:22:25,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 18:22:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:22:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 18:22:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 18:22:25,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-15 18:22:25,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:25,818 INFO L225 Difference]: With dead ends: 342 [2022-04-15 18:22:25,819 INFO L226 Difference]: Without dead ends: 174 [2022-04-15 18:22:25,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:22:25,823 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 34 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 18:22:25,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 631 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 18:22:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-15 18:22:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2022-04-15 18:22:25,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:22:25,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:25,852 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:25,852 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:25,859 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2022-04-15 18:22:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2022-04-15 18:22:25,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:25,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:25,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 174 states. [2022-04-15 18:22:25,860 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 174 states. [2022-04-15 18:22:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:25,866 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2022-04-15 18:22:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2022-04-15 18:22:25,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:25,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:25,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:22:25,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:22:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2022-04-15 18:22:25,873 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 51 [2022-04-15 18:22:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:22:25,873 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2022-04-15 18:22:25,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:25,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 242 transitions. [2022-04-15 18:22:26,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2022-04-15 18:22:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 18:22:26,033 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:22:26,034 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:22:26,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:22:26,034 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:22:26,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:22:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash -480939749, now seen corresponding path program 1 times [2022-04-15 18:22:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:26,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [157343634] [2022-04-15 18:22:26,052 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:22:26,052 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:22:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash -480939749, now seen corresponding path program 2 times [2022-04-15 18:22:26,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:22:26,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82019550] [2022-04-15 18:22:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:22:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:22:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:26,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:22:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:26,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1523#true} is VALID [2022-04-15 18:22:26,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-15 18:22:26,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1523#true} {1523#true} #708#return; {1523#true} is VALID [2022-04-15 18:22:26,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:22:26,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1523#true} is VALID [2022-04-15 18:22:26,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-15 18:22:26,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} #708#return; {1523#true} is VALID [2022-04-15 18:22:26,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {1523#true} call #t~ret161 := main(); {1523#true} is VALID [2022-04-15 18:22:26,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {1523#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1523#true} is VALID [2022-04-15 18:22:26,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {1523#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1523#true} is VALID [2022-04-15 18:22:26,244 INFO L272 TraceCheckUtils]: 7: Hoare triple {1523#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1523#true} is VALID [2022-04-15 18:22:26,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:22:26,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {1528#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1529#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-15 18:22:26,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {1529#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {1524#false} is VALID [2022-04-15 18:22:26,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {1524#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {1524#false} is VALID [2022-04-15 18:22:26,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {1524#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {1524#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {1524#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1524#false} is VALID [2022-04-15 18:22:26,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {1524#false} ~skip~0 := 0; {1524#false} is VALID [2022-04-15 18:22:26,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-04-15 18:22:26,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {1524#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {1524#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {1524#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {1524#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {1524#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {1524#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {1524#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {1524#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {1524#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {1524#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {1524#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {1524#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {1524#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {1524#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {1524#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {1524#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,258 INFO L290 TraceCheckUtils]: 44: Hoare triple {1524#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {1524#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {1524#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {1524#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {1524#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {1524#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {1524#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {1524#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {1524#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {1524#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {1524#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,261 INFO L290 TraceCheckUtils]: 55: Hoare triple {1524#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {1524#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 18:22:26,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {1524#false} assume 8640 == #t~mem75;havoc #t~mem75; {1524#false} is VALID [2022-04-15 18:22:26,262 INFO L290 TraceCheckUtils]: 58: Hoare triple {1524#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1524#false} is VALID [2022-04-15 18:22:26,262 INFO L290 TraceCheckUtils]: 59: Hoare triple {1524#false} assume !(4 == ~blastFlag~0); {1524#false} is VALID [2022-04-15 18:22:26,263 INFO L290 TraceCheckUtils]: 60: Hoare triple {1524#false} assume !(7 == ~blastFlag~0); {1524#false} is VALID [2022-04-15 18:22:26,263 INFO L290 TraceCheckUtils]: 61: Hoare triple {1524#false} assume !(10 == ~blastFlag~0); {1524#false} is VALID [2022-04-15 18:22:26,263 INFO L290 TraceCheckUtils]: 62: Hoare triple {1524#false} assume 13 == ~blastFlag~0; {1524#false} is VALID [2022-04-15 18:22:26,264 INFO L290 TraceCheckUtils]: 63: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-04-15 18:22:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:22:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:22:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82019550] [2022-04-15 18:22:26,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82019550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:26,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:26,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:26,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:22:26,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [157343634] [2022-04-15 18:22:26,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [157343634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:26,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:26,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254414551] [2022-04-15 18:22:26,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:22:26,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 18:22:26,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:22:26,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:26,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:26,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:22:26,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:26,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:22:26,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:22:26,315 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:31,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:22:35,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:22:38,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:22:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:39,348 INFO L93 Difference]: Finished difference Result 305 states and 467 transitions. [2022-04-15 18:22:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:22:39,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 18:22:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:22:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-15 18:22:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-15 18:22:39,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 467 transitions. [2022-04-15 18:22:39,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:39,679 INFO L225 Difference]: With dead ends: 305 [2022-04-15 18:22:39,679 INFO L226 Difference]: Without dead ends: 174 [2022-04-15 18:22:39,680 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:22:39,681 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 24 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:22:39,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 507 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-04-15 18:22:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-15 18:22:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2022-04-15 18:22:39,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:22:39,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 152 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:39,698 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 152 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:39,698 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 152 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:39,702 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2022-04-15 18:22:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 262 transitions. [2022-04-15 18:22:39,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:39,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:39,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 152 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 174 states. [2022-04-15 18:22:39,703 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 152 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 174 states. [2022-04-15 18:22:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:39,707 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2022-04-15 18:22:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 262 transitions. [2022-04-15 18:22:39,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:39,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:39,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:22:39,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:22:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 152 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2022-04-15 18:22:39,712 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 64 [2022-04-15 18:22:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:22:39,712 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2022-04-15 18:22:39,712 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:39,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 241 transitions. [2022-04-15 18:22:39,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2022-04-15 18:22:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 18:22:39,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:22:39,869 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:22:39,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:22:39,869 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:22:39,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:22:39,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1522986347, now seen corresponding path program 1 times [2022-04-15 18:22:39,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:39,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908686466] [2022-04-15 18:22:39,888 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:22:39,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:22:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1522986347, now seen corresponding path program 2 times [2022-04-15 18:22:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:22:39,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307561699] [2022-04-15 18:22:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:22:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:22:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:40,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:22:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:22:40,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {2814#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {2807#true} is VALID [2022-04-15 18:22:40,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {2807#true} assume true; {2807#true} is VALID [2022-04-15 18:22:40,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2807#true} {2807#true} #708#return; {2807#true} is VALID [2022-04-15 18:22:40,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {2807#true} call ULTIMATE.init(); {2814#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:22:40,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {2814#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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(196, 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); {2807#true} is VALID [2022-04-15 18:22:40,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {2807#true} assume true; {2807#true} is VALID [2022-04-15 18:22:40,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2807#true} {2807#true} #708#return; {2807#true} is VALID [2022-04-15 18:22:40,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {2807#true} call #t~ret161 := main(); {2807#true} is VALID [2022-04-15 18:22:40,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {2807#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2807#true} is VALID [2022-04-15 18:22:40,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {2807#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {2807#true} is VALID [2022-04-15 18:22:40,024 INFO L272 TraceCheckUtils]: 7: Hoare triple {2807#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2807#true} is VALID [2022-04-15 18:22:40,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {2807#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:22:40,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:22:40,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:22:40,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:22:40,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:22:40,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:22:40,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-15 18:22:40,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {2812#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2813#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-15 18:22:40,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {2813#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {2808#false} is VALID [2022-04-15 18:22:40,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {2808#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {2808#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {2808#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2808#false} is VALID [2022-04-15 18:22:40,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {2808#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {2808#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, 80 + ~s.offset, 8); {2808#false} is VALID [2022-04-15 18:22:40,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {2808#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {2808#false} is VALID [2022-04-15 18:22:40,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {2808#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {2808#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {2808#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {2808#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2808#false} is VALID [2022-04-15 18:22:40,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {2808#false} ~skip~0 := 0; {2808#false} is VALID [2022-04-15 18:22:40,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {2808#false} assume !false; {2808#false} is VALID [2022-04-15 18:22:40,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {2808#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {2808#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {2808#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {2808#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {2808#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {2808#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {2808#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {2808#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {2808#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {2808#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {2808#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {2808#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {2808#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {2808#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {2808#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {2808#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {2808#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {2808#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {2808#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {2808#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {2808#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {2808#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {2808#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {2808#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {2808#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {2808#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {2808#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {2808#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {2808#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {2808#false} is VALID [2022-04-15 18:22:40,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {2808#false} assume 8640 == #t~mem75;havoc #t~mem75; {2808#false} is VALID [2022-04-15 18:22:40,035 INFO L290 TraceCheckUtils]: 59: Hoare triple {2808#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2808#false} is VALID [2022-04-15 18:22:40,035 INFO L290 TraceCheckUtils]: 60: Hoare triple {2808#false} assume !(4 == ~blastFlag~0); {2808#false} is VALID [2022-04-15 18:22:40,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {2808#false} assume !(7 == ~blastFlag~0); {2808#false} is VALID [2022-04-15 18:22:40,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {2808#false} assume !(10 == ~blastFlag~0); {2808#false} is VALID [2022-04-15 18:22:40,035 INFO L290 TraceCheckUtils]: 63: Hoare triple {2808#false} assume 13 == ~blastFlag~0; {2808#false} is VALID [2022-04-15 18:22:40,035 INFO L290 TraceCheckUtils]: 64: Hoare triple {2808#false} assume !false; {2808#false} is VALID [2022-04-15 18:22:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:22:40,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:22:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307561699] [2022-04-15 18:22:40,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307561699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:40,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:40,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:40,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:22:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908686466] [2022-04-15 18:22:40,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908686466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:22:40,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:22:40,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:22:40,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774354252] [2022-04-15 18:22:40,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:22:40,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 18:22:40,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:22:40,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:40,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:40,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:22:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:40,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:22:40,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:22:40,080 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:42,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:22:44,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:22:46,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:22:48,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:22:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:49,914 INFO L93 Difference]: Finished difference Result 407 states and 632 transitions. [2022-04-15 18:22:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:22:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 18:22:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:22:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-15 18:22:49,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-15 18:22:49,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 614 transitions. [2022-04-15 18:22:50,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:50,319 INFO L225 Difference]: With dead ends: 407 [2022-04-15 18:22:50,319 INFO L226 Difference]: Without dead ends: 276 [2022-04-15 18:22:50,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:22:50,321 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 154 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-15 18:22:50,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 368 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 481 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-04-15 18:22:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-04-15 18:22:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 168. [2022-04-15 18:22:50,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:22:50,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 276 states. Second operand has 168 states, 163 states have (on average 1.5460122699386503) internal successors, (252), 163 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:50,330 INFO L74 IsIncluded]: Start isIncluded. First operand 276 states. Second operand has 168 states, 163 states have (on average 1.5460122699386503) internal successors, (252), 163 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:50,330 INFO L87 Difference]: Start difference. First operand 276 states. Second operand has 168 states, 163 states have (on average 1.5460122699386503) internal successors, (252), 163 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:50,336 INFO L93 Difference]: Finished difference Result 276 states and 426 transitions. [2022-04-15 18:22:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 426 transitions. [2022-04-15 18:22:50,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:50,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:50,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.5460122699386503) internal successors, (252), 163 states have internal predecessors, (252), 3 states have call successors, (3), 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 276 states. [2022-04-15 18:22:50,338 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.5460122699386503) internal successors, (252), 163 states have internal predecessors, (252), 3 states have call successors, (3), 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 276 states. [2022-04-15 18:22:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:22:50,343 INFO L93 Difference]: Finished difference Result 276 states and 426 transitions. [2022-04-15 18:22:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 426 transitions. [2022-04-15 18:22:50,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:22:50,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:22:50,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:22:50,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:22:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.5460122699386503) internal successors, (252), 163 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2022-04-15 18:22:50,347 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 65 [2022-04-15 18:22:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:22:50,347 INFO L478 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2022-04-15 18:22:50,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:22:50,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 256 transitions. [2022-04-15 18:22:50,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:22:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2022-04-15 18:22:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 18:22:50,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:22:50,527 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:22:50,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:22:50,527 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:22:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:22:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash -112549033, now seen corresponding path program 1 times [2022-04-15 18:22:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:22:50,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [816246708] [2022-04-15 18:22:50,598 ERROR L250 FreeRefinementEngine]: Caught unknown exception: Undeclared function symbol (* (Array Int (Array Int Int)) Int) [2022-04-15 18:22:50,598 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-15 18:22:50,599 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (* (Array Int (Array Int Int)) Int) at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1615) 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.smtlibutils.SmtUtils.mul(SmtUtils.java:597) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrUtils.matrixVectorMultiplicationWithVariables(QvasrUtils.java:226) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.intVasrAbstractionToFormula(QvasrSummarizer.java:177) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:140) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 18:22:50,602 INFO L158 Benchmark]: Toolchain (without parser) took 35142.51ms. Allocated memory was 190.8MB in the beginning and 250.6MB in the end (delta: 59.8MB). Free memory was 133.5MB in the beginning and 137.1MB in the end (delta: -3.6MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2022-04-15 18:22:50,602 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 18:22:50,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.31ms. Allocated memory was 190.8MB in the beginning and 250.6MB in the end (delta: 59.8MB). Free memory was 133.3MB in the beginning and 199.9MB in the end (delta: -66.6MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-04-15 18:22:50,602 INFO L158 Benchmark]: Boogie Preprocessor took 111.14ms. Allocated memory is still 250.6MB. Free memory was 199.9MB in the beginning and 190.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 18:22:50,603 INFO L158 Benchmark]: RCFGBuilder took 1188.92ms. Allocated memory is still 250.6MB. Free memory was 190.0MB in the beginning and 179.7MB in the end (delta: 10.3MB). Peak memory consumption was 59.0MB. Max. memory is 8.0GB. [2022-04-15 18:22:50,603 INFO L158 Benchmark]: TraceAbstraction took 33360.85ms. Allocated memory is still 250.6MB. Free memory was 179.1MB in the beginning and 137.1MB in the end (delta: 42.1MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. [2022-04-15 18:22:50,607 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.13ms. Allocated memory is still 190.8MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 478.31ms. Allocated memory was 190.8MB in the beginning and 250.6MB in the end (delta: 59.8MB). Free memory was 133.3MB in the beginning and 199.9MB in the end (delta: -66.6MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 111.14ms. Allocated memory is still 250.6MB. Free memory was 199.9MB in the beginning and 190.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1188.92ms. Allocated memory is still 250.6MB. Free memory was 190.0MB in the beginning and 179.7MB in the end (delta: 10.3MB). Peak memory consumption was 59.0MB. Max. memory is 8.0GB. * TraceAbstraction took 33360.85ms. Allocated memory is still 250.6MB. Free memory was 179.1MB in the beginning and 137.1MB in the end (delta: 42.1MB). Peak memory consumption was 41.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (* (Array Int (Array Int Int)) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (* (Array Int (Array Int Int)) Int): de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1615) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 18:22:50,637 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...