/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.08.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:19:05,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:19:05,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:19:05,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:19:05,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:19:05,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:19:05,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:19:05,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:19:05,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:19:05,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:19:05,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:19:05,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:19:05,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:19:05,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:19:05,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:19:05,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:19:05,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:19:05,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:19:05,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:19:05,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:19:05,809 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:19:05,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:19:05,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:19:05,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:19:05,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:19:05,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:19:05,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:19:05,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:19:05,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:19:05,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:19:05,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:19:05,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:19:05,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:19:05,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:19:05,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:19:05,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:19:05,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:19:05,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:19:05,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:19:05,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:19:05,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:19:05,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:19:05,828 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:19:05,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:19:05,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:19:05,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:19:05,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:19:05,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:19:05,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:19:05,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:19:05,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:19:05,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:19:05,841 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:19:05,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:19:05,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:19:05,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:19:05,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:19:05,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:19:05,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:19:05,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:19:05,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:19:05,842 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:19:05,842 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:19:05,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:19:05,843 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:19:05,843 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:19:06,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:19:06,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:19:06,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:19:06,122 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:19:06,122 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:19:06,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-1.c [2022-04-15 18:19:06,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd4ef8b5/901d96504ef3433cb35351cf29cba7b5/FLAG149d5e9b6 [2022-04-15 18:19:06,740 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:19:06,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-1.c [2022-04-15 18:19:06,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd4ef8b5/901d96504ef3433cb35351cf29cba7b5/FLAG149d5e9b6 [2022-04-15 18:19:07,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd4ef8b5/901d96504ef3433cb35351cf29cba7b5 [2022-04-15 18:19:07,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:19:07,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:19:07,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:19:07,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:19:07,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:19:07,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a44aca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07, skipping insertion in model container [2022-04-15 18:19:07,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:19:07,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:19:07,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-1.c[74696,74709] [2022-04-15 18:19:07,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:19:07,448 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:19:07,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-1.c[74696,74709] [2022-04-15 18:19:07,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:19:07,601 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:19:07,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07 WrapperNode [2022-04-15 18:19:07,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:19:07,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:19:07,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:19:07,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:19:07,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:19:07,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:19:07,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:19:07,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:19:07,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07" (1/1) ... [2022-04-15 18:19:07,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:19:07,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:19:07,745 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:19:07,760 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:19:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:19:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:19:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:19:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 18:19:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 18:19:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:19:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 18:19:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 18:19:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 18:19:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 18:19:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:19:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:19:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:19:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:19:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:19:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:19:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:19:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:19:08,011 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:19:08,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:19:08,652 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:19:09,208 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 18:19:09,208 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 18:19:09,220 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:19:09,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:19:09,232 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:19:09,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:19:09 BoogieIcfgContainer [2022-04-15 18:19:09,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:19:09,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:19:09,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:19:09,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:19:09,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:19:07" (1/3) ... [2022-04-15 18:19:09,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203d715d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:19:09, skipping insertion in model container [2022-04-15 18:19:09,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:19:07" (2/3) ... [2022-04-15 18:19:09,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203d715d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:19:09, skipping insertion in model container [2022-04-15 18:19:09,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:19:09" (3/3) ... [2022-04-15 18:19:09,242 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2022-04-15 18:19:09,246 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:19:09,246 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:19:09,286 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:19:09,294 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:19:09,294 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:19:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 151 states have (on average 1.7086092715231789) internal successors, (258), 152 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 18:19:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 18:19:09,333 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:09,333 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] [2022-04-15 18:19:09,333 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1930935805, now seen corresponding path program 1 times [2022-04-15 18:19:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:09,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515480301] [2022-04-15 18:19:09,351 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:19:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1930935805, now seen corresponding path program 2 times [2022-04-15 18:19:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:09,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952758538] [2022-04-15 18:19:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:09,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:09,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {162#true} is VALID [2022-04-15 18:19:09,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-15 18:19:09,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162#true} {162#true} #693#return; {162#true} is VALID [2022-04-15 18:19:09,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {169#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:19:09,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {162#true} is VALID [2022-04-15 18:19:09,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-15 18:19:09,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #693#return; {162#true} is VALID [2022-04-15 18:19:09,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} call #t~ret161 := main(); {162#true} is VALID [2022-04-15 18:19:09,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(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; {162#true} is VALID [2022-04-15 18:19:09,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {162#true} is VALID [2022-04-15 18:19:09,950 INFO L272 TraceCheckUtils]: 7: Hoare triple {162#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {162#true} is VALID [2022-04-15 18:19:09,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -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;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);~blastFlag~0 := 0;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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#(= 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; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(= 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; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#(= 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)))); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#(= 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; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:09,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {167#(= 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); {168#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 18:19:09,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {168#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {163#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {163#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {163#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {163#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {163#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {163#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {163#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {163#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {163#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {163#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {163#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {163#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {163#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {163#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {163#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {163#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {163#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {163#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {163#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {163#false} is VALID [2022-04-15 18:19:09,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {163#false} assume 8640 == #t~mem75;havoc #t~mem75; {163#false} is VALID [2022-04-15 18:19:09,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {163#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {163#false} is VALID [2022-04-15 18:19:09,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {163#false} assume !(4 == ~blastFlag~0); {163#false} is VALID [2022-04-15 18:19:09,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {163#false} assume !(7 == ~blastFlag~0); {163#false} is VALID [2022-04-15 18:19:09,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {163#false} assume 10 == ~blastFlag~0; {163#false} is VALID [2022-04-15 18:19:09,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-04-15 18:19:09,982 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:19:09,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:09,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952758538] [2022-04-15 18:19:09,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952758538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:09,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:09,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:09,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:09,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515480301] [2022-04-15 18:19:09,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515480301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:09,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:09,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:09,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948659227] [2022-04-15 18:19:09,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:10,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 18:19:10,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:10,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:10,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:10,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:10,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:10,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:10,102 INFO L87 Difference]: Start difference. First operand has 159 states, 151 states have (on average 1.7086092715231789) internal successors, (258), 152 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:15,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:19,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:21,422 INFO L93 Difference]: Finished difference Result 336 states and 564 transitions. [2022-04-15 18:19:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:21,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 18:19:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-15 18:19:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-15 18:19:21,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-15 18:19:21,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:21,945 INFO L225 Difference]: With dead ends: 336 [2022-04-15 18:19:21,945 INFO L226 Difference]: Without dead ends: 171 [2022-04-15 18:19:21,949 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:19:21,956 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 34 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:21,957 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 613 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 18:19:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-15 18:19:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2022-04-15 18:19:22,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:22,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:22,014 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:22,014 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:22,028 INFO L93 Difference]: Finished difference Result 171 states and 257 transitions. [2022-04-15 18:19:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2022-04-15 18:19:22,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:22,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:22,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 171 states. [2022-04-15 18:19:22,038 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 171 states. [2022-04-15 18:19:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:22,047 INFO L93 Difference]: Finished difference Result 171 states and 257 transitions. [2022-04-15 18:19:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2022-04-15 18:19:22,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:22,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:22,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:22,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 236 transitions. [2022-04-15 18:19:22,057 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 236 transitions. Word has length 50 [2022-04-15 18:19:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:22,058 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 236 transitions. [2022-04-15 18:19:22,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:22,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 236 transitions. [2022-04-15 18:19:22,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2022-04-15 18:19:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 18:19:22,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:22,252 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] [2022-04-15 18:19:22,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:19:22,252 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:22,253 INFO L85 PathProgramCache]: Analyzing trace with hash -213156207, now seen corresponding path program 1 times [2022-04-15 18:19:22,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:22,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262565435] [2022-04-15 18:19:22,281 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:19:22,281 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:19:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash -213156207, now seen corresponding path program 2 times [2022-04-15 18:19:22,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:22,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954848298] [2022-04-15 18:19:22,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:22,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:22,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {1496#true} is VALID [2022-04-15 18:19:22,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {1496#true} assume true; {1496#true} is VALID [2022-04-15 18:19:22,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1496#true} {1496#true} #693#return; {1496#true} is VALID [2022-04-15 18:19:22,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {1496#true} call ULTIMATE.init(); {1503#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:19:22,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {1496#true} is VALID [2022-04-15 18:19:22,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {1496#true} assume true; {1496#true} is VALID [2022-04-15 18:19:22,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1496#true} {1496#true} #693#return; {1496#true} is VALID [2022-04-15 18:19:22,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {1496#true} call #t~ret161 := main(); {1496#true} is VALID [2022-04-15 18:19:22,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {1496#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(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; {1496#true} is VALID [2022-04-15 18:19:22,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {1496#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1496#true} is VALID [2022-04-15 18:19:22,523 INFO L272 TraceCheckUtils]: 7: Hoare triple {1496#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1496#true} is VALID [2022-04-15 18:19:22,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {1496#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -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;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);~blastFlag~0 := 0;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); {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} 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; {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} 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; {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !false; {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} 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); {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-15 18:19:22,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1502#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-15 18:19:22,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {1502#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {1497#false} is VALID [2022-04-15 18:19:22,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {1497#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; {1497#false} is VALID [2022-04-15 18:19:22,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {1497#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); {1497#false} is VALID [2022-04-15 18:19:22,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {1497#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); {1497#false} is VALID [2022-04-15 18:19:22,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {1497#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1497#false} is VALID [2022-04-15 18:19:22,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {1497#false} ~skip~0 := 0; {1497#false} is VALID [2022-04-15 18:19:22,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {1497#false} assume !false; {1497#false} is VALID [2022-04-15 18:19:22,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {1497#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); {1497#false} is VALID [2022-04-15 18:19:22,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {1497#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {1497#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {1497#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {1497#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {1497#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {1497#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {1497#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {1497#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {1497#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {1497#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {1497#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {1497#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {1497#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {1497#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {1497#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {1497#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {1497#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {1497#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {1497#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {1497#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {1497#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {1497#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {1497#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {1497#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {1497#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {1497#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {1497#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {1497#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {1497#false} is VALID [2022-04-15 18:19:22,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {1497#false} assume 8640 == #t~mem75;havoc #t~mem75; {1497#false} is VALID [2022-04-15 18:19:22,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {1497#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1497#false} is VALID [2022-04-15 18:19:22,541 INFO L290 TraceCheckUtils]: 59: Hoare triple {1497#false} assume !(4 == ~blastFlag~0); {1497#false} is VALID [2022-04-15 18:19:22,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {1497#false} assume !(7 == ~blastFlag~0); {1497#false} is VALID [2022-04-15 18:19:22,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {1497#false} assume 10 == ~blastFlag~0; {1497#false} is VALID [2022-04-15 18:19:22,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {1497#false} assume !false; {1497#false} is VALID [2022-04-15 18:19:22,542 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:19:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:22,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954848298] [2022-04-15 18:19:22,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954848298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:22,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:22,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:22,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:22,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262565435] [2022-04-15 18:19:22,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262565435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:22,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775382941] [2022-04-15 18:19:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:22,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 18:19:22,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:22,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:22,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:22,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:22,600 INFO L87 Difference]: Start difference. First operand 154 states and 236 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:24,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:28,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:30,597 INFO L93 Difference]: Finished difference Result 400 states and 618 transitions. [2022-04-15 18:19:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:30,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 18:19:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-15 18:19:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-15 18:19:30,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 599 transitions. [2022-04-15 18:19:31,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:31,152 INFO L225 Difference]: With dead ends: 400 [2022-04-15 18:19:31,152 INFO L226 Difference]: Without dead ends: 272 [2022-04-15 18:19:31,153 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:19:31,154 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 145 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:31,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 636 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 18:19:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-15 18:19:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 170. [2022-04-15 18:19:31,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:31,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand has 170 states, 165 states have (on average 1.5575757575757576) internal successors, (257), 165 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have 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:19:31,167 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand has 170 states, 165 states have (on average 1.5575757575757576) internal successors, (257), 165 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have 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:19:31,168 INFO L87 Difference]: Start difference. First operand 272 states. Second operand has 170 states, 165 states have (on average 1.5575757575757576) internal successors, (257), 165 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have 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:19:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:31,194 INFO L93 Difference]: Finished difference Result 272 states and 418 transitions. [2022-04-15 18:19:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 418 transitions. [2022-04-15 18:19:31,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:31,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:31,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5575757575757576) internal successors, (257), 165 states have internal predecessors, (257), 3 states have call successors, (3), 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 272 states. [2022-04-15 18:19:31,196 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5575757575757576) internal successors, (257), 165 states have internal predecessors, (257), 3 states have call successors, (3), 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 272 states. [2022-04-15 18:19:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:31,207 INFO L93 Difference]: Finished difference Result 272 states and 418 transitions. [2022-04-15 18:19:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 418 transitions. [2022-04-15 18:19:31,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:31,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:31,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:31,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5575757575757576) internal successors, (257), 165 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have 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:19:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 261 transitions. [2022-04-15 18:19:31,215 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 261 transitions. Word has length 63 [2022-04-15 18:19:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:31,215 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 261 transitions. [2022-04-15 18:19:31,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:19:31,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 261 transitions. [2022-04-15 18:19:31,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 261 transitions. [2022-04-15 18:19:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 18:19:31,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:31,545 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] [2022-04-15 18:19:31,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:19:31,545 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:31,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash 369840513, now seen corresponding path program 1 times [2022-04-15 18:19:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:31,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [222011730] [2022-04-15 18:19:31,569 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:19:31,569 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:19:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash 369840513, now seen corresponding path program 2 times [2022-04-15 18:19:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:19:31,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169044544] [2022-04-15 18:19:31,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:19:31,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:19:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:19:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:19:31,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {3199#(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); {3192#true} is VALID [2022-04-15 18:19:31,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {3192#true} assume true; {3192#true} is VALID [2022-04-15 18:19:31,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3192#true} {3192#true} #693#return; {3192#true} is VALID [2022-04-15 18:19:31,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {3192#true} call ULTIMATE.init(); {3199#(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:19:31,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {3199#(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); {3192#true} is VALID [2022-04-15 18:19:31,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {3192#true} assume true; {3192#true} is VALID [2022-04-15 18:19:31,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3192#true} {3192#true} #693#return; {3192#true} is VALID [2022-04-15 18:19:31,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {3192#true} call #t~ret161 := main(); {3192#true} is VALID [2022-04-15 18:19:31,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {3192#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; {3192#true} is VALID [2022-04-15 18:19:31,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {3192#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3192#true} is VALID [2022-04-15 18:19:31,832 INFO L272 TraceCheckUtils]: 7: Hoare triple {3192#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3192#true} is VALID [2022-04-15 18:19:31,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {3192#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;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);~blastFlag~0 := 0;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); {3197#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:31,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {3197#(= 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; {3197#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:31,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {3197#(= 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; {3197#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:31,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {3197#(= 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)))); {3197#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:31,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {3197#(= 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); {3197#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:31,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {3197#(= 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; {3197#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:31,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {3197#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {3197#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:19:31,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {3197#(= 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); {3198#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-15 18:19:31,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {3198#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {3193#false} is VALID [2022-04-15 18:19:31,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {3193#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {3193#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {3193#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {3193#false} is VALID [2022-04-15 18:19:31,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {3193#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {3193#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); {3193#false} is VALID [2022-04-15 18:19:31,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {3193#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {3193#false} is VALID [2022-04-15 18:19:31,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {3193#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); {3193#false} is VALID [2022-04-15 18:19:31,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {3193#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); {3193#false} is VALID [2022-04-15 18:19:31,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {3193#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); {3193#false} is VALID [2022-04-15 18:19:31,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {3193#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3193#false} is VALID [2022-04-15 18:19:31,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {3193#false} ~skip~0 := 0; {3193#false} is VALID [2022-04-15 18:19:31,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {3193#false} assume !false; {3193#false} is VALID [2022-04-15 18:19:31,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {3193#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); {3193#false} is VALID [2022-04-15 18:19:31,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {3193#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {3193#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {3193#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {3193#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {3193#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {3193#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {3193#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {3193#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {3193#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {3193#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {3193#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {3193#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {3193#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {3193#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {3193#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {3193#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {3193#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {3193#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {3193#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {3193#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {3193#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,846 INFO L290 TraceCheckUtils]: 51: Hoare triple {3193#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,847 INFO L290 TraceCheckUtils]: 52: Hoare triple {3193#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,847 INFO L290 TraceCheckUtils]: 53: Hoare triple {3193#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {3193#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {3193#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {3193#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {3193#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3193#false} is VALID [2022-04-15 18:19:31,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {3193#false} assume 8640 == #t~mem75;havoc #t~mem75; {3193#false} is VALID [2022-04-15 18:19:31,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {3193#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3193#false} is VALID [2022-04-15 18:19:31,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {3193#false} assume !(4 == ~blastFlag~0); {3193#false} is VALID [2022-04-15 18:19:31,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {3193#false} assume !(7 == ~blastFlag~0); {3193#false} is VALID [2022-04-15 18:19:31,850 INFO L290 TraceCheckUtils]: 62: Hoare triple {3193#false} assume 10 == ~blastFlag~0; {3193#false} is VALID [2022-04-15 18:19:31,851 INFO L290 TraceCheckUtils]: 63: Hoare triple {3193#false} assume !false; {3193#false} is VALID [2022-04-15 18:19:31,851 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:19:31,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:19:31,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169044544] [2022-04-15 18:19:31,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169044544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:31,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:31,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:31,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:19:31,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [222011730] [2022-04-15 18:19:31,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [222011730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:19:31,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:19:31,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:19:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600781553] [2022-04-15 18:19:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:19:31,856 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:19:31,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:19:31,857 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:19:31,917 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:19:31,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:19:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:31,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:19:31,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:19:31,919 INFO L87 Difference]: Start difference. First operand 170 states and 261 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:19:34,301 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:19:38,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:19:40,208 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:19:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:42,070 INFO L93 Difference]: Finished difference Result 330 states and 505 transitions. [2022-04-15 18:19:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:19:42,070 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:19:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:19:42,071 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:19:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-15 18:19:42,076 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:19:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-15 18:19:42,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-15 18:19:42,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:42,399 INFO L225 Difference]: With dead ends: 330 [2022-04-15 18:19:42,399 INFO L226 Difference]: Without dead ends: 186 [2022-04-15 18:19:42,400 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:19:42,400 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 28 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:19:42,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 491 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 363 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 18:19:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-15 18:19:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2022-04-15 18:19:42,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:19:42,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 170 states, 165 states have (on average 1.5515151515151515) internal successors, (256), 165 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have 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:19:42,411 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 170 states, 165 states have (on average 1.5515151515151515) internal successors, (256), 165 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have 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:19:42,412 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 170 states, 165 states have (on average 1.5515151515151515) internal successors, (256), 165 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have 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:19:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:42,420 INFO L93 Difference]: Finished difference Result 186 states and 280 transitions. [2022-04-15 18:19:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2022-04-15 18:19:42,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:42,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:42,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5515151515151515) internal successors, (256), 165 states have internal predecessors, (256), 3 states have call successors, (3), 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 186 states. [2022-04-15 18:19:42,422 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5515151515151515) internal successors, (256), 165 states have internal predecessors, (256), 3 states have call successors, (3), 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 186 states. [2022-04-15 18:19:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:19:42,430 INFO L93 Difference]: Finished difference Result 186 states and 280 transitions. [2022-04-15 18:19:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2022-04-15 18:19:42,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:19:42,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:19:42,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:19:42,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:19:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5515151515151515) internal successors, (256), 165 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have 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:19:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 260 transitions. [2022-04-15 18:19:42,438 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 260 transitions. Word has length 64 [2022-04-15 18:19:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:19:42,439 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 260 transitions. [2022-04-15 18:19:42,439 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:19:42,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 260 transitions. [2022-04-15 18:19:42,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:19:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 260 transitions. [2022-04-15 18:19:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 18:19:42,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:19:42,643 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] [2022-04-15 18:19:42,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:19:42,643 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:19:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:19:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2038223339, now seen corresponding path program 1 times [2022-04-15 18:19:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:19:42,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872463478] [2022-04-15 18:19:42,734 ERROR L250 FreeRefinementEngine]: Caught unknown exception: Undeclared function symbol (* (Array Int (Array Int Int)) Int) [2022-04-15 18:19:42,734 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-15 18:19:42,735 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:19:42,742 INFO L158 Benchmark]: Toolchain (without parser) took 35732.71ms. Allocated memory was 168.8MB in the beginning and 218.1MB in the end (delta: 49.3MB). Free memory was 114.7MB in the beginning and 75.2MB in the end (delta: 39.5MB). Peak memory consumption was 89.2MB. Max. memory is 8.0GB. [2022-04-15 18:19:42,742 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 168.8MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 18:19:42,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.52ms. Allocated memory is still 168.8MB. Free memory was 114.5MB in the beginning and 120.6MB in the end (delta: -6.1MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-04-15 18:19:42,743 INFO L158 Benchmark]: Boogie Preprocessor took 115.75ms. Allocated memory is still 168.8MB. Free memory was 120.6MB in the beginning and 110.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 18:19:42,743 INFO L158 Benchmark]: RCFGBuilder took 1515.51ms. Allocated memory is still 168.8MB. Free memory was 110.6MB in the beginning and 70.8MB in the end (delta: 39.8MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-04-15 18:19:42,744 INFO L158 Benchmark]: TraceAbstraction took 33504.47ms. Allocated memory was 168.8MB in the beginning and 218.1MB in the end (delta: 49.3MB). Free memory was 70.3MB in the beginning and 75.2MB in the end (delta: -4.9MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. [2022-04-15 18:19:42,749 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.14ms. Allocated memory is still 168.8MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 590.52ms. Allocated memory is still 168.8MB. Free memory was 114.5MB in the beginning and 120.6MB in the end (delta: -6.1MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 115.75ms. Allocated memory is still 168.8MB. Free memory was 120.6MB in the beginning and 110.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1515.51ms. Allocated memory is still 168.8MB. Free memory was 110.6MB in the beginning and 70.8MB in the end (delta: 39.8MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 33504.47ms. Allocated memory was 168.8MB in the beginning and 218.1MB in the end (delta: 49.3MB). Free memory was 70.3MB in the beginning and 75.2MB in the end (delta: -4.9MB). Peak memory consumption was 44.3MB. 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:19:42,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...