/usr/bin/java -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.04.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 08:41:38,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 08:41:38,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 08:41:38,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 08:41:38,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 08:41:38,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 08:41:38,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 08:41:38,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 08:41:38,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 08:41:38,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 08:41:38,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 08:41:38,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 08:41:38,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 08:41:38,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 08:41:38,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 08:41:38,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 08:41:38,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 08:41:38,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 08:41:38,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 08:41:38,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 08:41:38,635 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 08:41:38,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 08:41:38,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 08:41:38,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 08:41:38,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 08:41:38,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 08:41:38,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 08:41:38,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 08:41:38,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 08:41:38,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 08:41:38,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 08:41:38,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 08:41:38,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 08:41:38,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 08:41:38,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 08:41:38,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 08:41:38,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 08:41:38,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 08:41:38,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 08:41:38,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 08:41:38,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 08:41:38,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 08:41:38,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-06 08:41:38,666 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 08:41:38,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 08:41:38,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 08:41:38,668 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 08:41:38,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 08:41:38,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 08:41:38,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 08:41:38,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 08:41:38,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 08:41:38,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 08:41:38,669 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 08:41:38,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 08:41:38,669 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 08:41:38,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 08:41:38,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 08:41:38,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 08:41:38,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 08:41:38,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 08:41:38,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 08:41:38,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 08:41:38,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 08:41:38,670 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 08:41:38,671 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-06 08:41:38,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 08:41:38,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 08:41:38,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 08:41:38,897 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 08:41:38,898 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 08:41:38,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.04.i.cil.c [2022-04-06 08:41:38,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ee7a3b0/99b175a426f146159ed6bb1f0442a1a7/FLAGa325913f1 [2022-04-06 08:41:39,435 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 08:41:39,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.04.i.cil.c [2022-04-06 08:41:39,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ee7a3b0/99b175a426f146159ed6bb1f0442a1a7/FLAGa325913f1 [2022-04-06 08:41:39,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ee7a3b0/99b175a426f146159ed6bb1f0442a1a7 [2022-04-06 08:41:39,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 08:41:39,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 08:41:39,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 08:41:39,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 08:41:39,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 08:41:39,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:41:39" (1/1) ... [2022-04-06 08:41:39,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1fea5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:39, skipping insertion in model container [2022-04-06 08:41:39,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:41:39" (1/1) ... [2022-04-06 08:41:40,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 08:41:40,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 08:41:40,271 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.04.i.cil.c[72500,72513] [2022-04-06 08:41:40,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 08:41:40,284 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 08:41:40,347 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.04.i.cil.c[72500,72513] [2022-04-06 08:41:40,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 08:41:40,362 INFO L208 MainTranslator]: Completed translation [2022-04-06 08:41:40,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40 WrapperNode [2022-04-06 08:41:40,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 08:41:40,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 08:41:40,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 08:41:40,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 08:41:40,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40" (1/1) ... [2022-04-06 08:41:40,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40" (1/1) ... [2022-04-06 08:41:40,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40" (1/1) ... [2022-04-06 08:41:40,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40" (1/1) ... [2022-04-06 08:41:40,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40" (1/1) ... [2022-04-06 08:41:40,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40" (1/1) ... [2022-04-06 08:41:40,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40" (1/1) ... [2022-04-06 08:41:40,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 08:41:40,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 08:41:40,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 08:41:40,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 08:41:40,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40" (1/1) ... [2022-04-06 08:41:40,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 08:41:40,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 08:41:40,464 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-06 08:41:40,481 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-06 08:41:40,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 08:41:40,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 08:41:40,492 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 08:41:40,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-06 08:41:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-06 08:41:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 08:41:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-06 08:41:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-06 08:41:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-06 08:41:40,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-06 08:41:40,493 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 08:41:40,494 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 08:41:40,494 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 08:41:40,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 08:41:40,494 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-06 08:41:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-06 08:41:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 08:41:40,606 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 08:41:40,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 08:41:42,922 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-06 08:41:43,207 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-06 08:41:43,207 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-06 08:41:43,215 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 08:41:43,220 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 08:41:43,220 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 08:41:43,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:41:43 BoogieIcfgContainer [2022-04-06 08:41:43,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 08:41:43,223 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 08:41:43,223 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 08:41:43,223 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 08:41:43,225 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:41:43" (1/1) ... [2022-04-06 08:41:43,227 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-06 08:41:43,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 08:41:43 BasicIcfg [2022-04-06 08:41:43,284 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 08:41:43,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 08:41:43,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 08:41:43,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 08:41:43,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 08:41:39" (1/4) ... [2022-04-06 08:41:43,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6367d601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:41:43, skipping insertion in model container [2022-04-06 08:41:43,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:41:40" (2/4) ... [2022-04-06 08:41:43,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6367d601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:41:43, skipping insertion in model container [2022-04-06 08:41:43,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:41:43" (3/4) ... [2022-04-06 08:41:43,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6367d601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 08:41:43, skipping insertion in model container [2022-04-06 08:41:43,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 08:41:43" (4/4) ... [2022-04-06 08:41:43,291 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.cJordan [2022-04-06 08:41:43,295 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-06 08:41:43,295 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 08:41:43,323 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 08:41:43,327 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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-06 08:41:43,328 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 08:41:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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-06 08:41:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-06 08:41:43,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:41:43,345 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:41:43,345 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:41:43,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:41:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1424627949, now seen corresponding path program 1 times [2022-04-06 08:41:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:41:43,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079513028] [2022-04-06 08:41:43,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:41:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:41:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:43,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:41:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:43,746 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-06 08:41:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:41:43,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079513028] [2022-04-06 08:41:43,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079513028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:41:43,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:41:43,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:41:43,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500185783] [2022-04-06 08:41:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:41:43,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:41:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:41:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:41:43,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:41:43,774 INFO L87 Difference]: Start difference. First operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:45,803 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-06 08:41:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:41:46,498 INFO L93 Difference]: Finished difference Result 276 states and 456 transitions. [2022-04-06 08:41:46,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:41:46,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-06 08:41:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:41:46,507 INFO L225 Difference]: With dead ends: 276 [2022-04-06 08:41:46,507 INFO L226 Difference]: Without dead ends: 250 [2022-04-06 08:41:46,508 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-06 08:41:46,513 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 138 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 65 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-06 08:41:46,514 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 433 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 519 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-06 08:41:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-06 08:41:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 180. [2022-04-06 08:41:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.6057142857142856) internal successors, (281), 175 states have internal predecessors, (281), 3 states have call successors, (3), 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-06 08:41:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2022-04-06 08:41:46,573 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 52 [2022-04-06 08:41:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:41:46,574 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2022-04-06 08:41:46,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2022-04-06 08:41:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-06 08:41:46,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:41:46,581 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:41:46,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 08:41:46,581 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:41:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:41:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1214740759, now seen corresponding path program 1 times [2022-04-06 08:41:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:41:46,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070887120] [2022-04-06 08:41:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:41:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:41:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:46,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:41:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:46,790 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-06 08:41:46,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:41:46,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070887120] [2022-04-06 08:41:46,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070887120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:41:46,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:41:46,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:41:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384451811] [2022-04-06 08:41:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:41:46,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:41:46,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:41:46,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:41:46,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:41:46,801 INFO L87 Difference]: Start difference. First operand 180 states and 285 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 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-06 08:41:48,819 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-06 08:41:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:41:49,201 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2022-04-06 08:41:49,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:41:49,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 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 53 [2022-04-06 08:41:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:41:49,203 INFO L225 Difference]: With dead ends: 208 [2022-04-06 08:41:49,203 INFO L226 Difference]: Without dead ends: 208 [2022-04-06 08:41:49,203 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-06 08:41:49,204 INFO L913 BasicCegarLoop]: 176 mSDtfsCounter, 22 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:41:49,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 451 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:41:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-06 08:41:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-04-06 08:41:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.6129032258064515) internal successors, (300), 186 states have internal predecessors, (300), 3 states have call successors, (3), 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-06 08:41:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 304 transitions. [2022-04-06 08:41:49,222 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 304 transitions. Word has length 53 [2022-04-06 08:41:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:41:49,222 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 304 transitions. [2022-04-06 08:41:49,223 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 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-06 08:41:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 304 transitions. [2022-04-06 08:41:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-06 08:41:49,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:41:49,224 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:41:49,224 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 08:41:49,224 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:41:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:41:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash -674348851, now seen corresponding path program 1 times [2022-04-06 08:41:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:41:49,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908363797] [2022-04-06 08:41:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:41:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:41:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:41:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:49,360 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-06 08:41:49,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:41:49,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908363797] [2022-04-06 08:41:49,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908363797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:41:49,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:41:49,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:41:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538714101] [2022-04-06 08:41:49,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:41:49,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:41:49,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:41:49,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:41:49,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:41:49,362 INFO L87 Difference]: Start difference. First operand 191 states and 304 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:51,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-06 08:41:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:41:51,660 INFO L93 Difference]: Finished difference Result 208 states and 324 transitions. [2022-04-06 08:41:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:41:51,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-06 08:41:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:41:51,662 INFO L225 Difference]: With dead ends: 208 [2022-04-06 08:41:51,662 INFO L226 Difference]: Without dead ends: 208 [2022-04-06 08:41:51,662 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-06 08:41:51,663 INFO L913 BasicCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 08:41:51,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 08:41:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-06 08:41:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-04-06 08:41:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.60752688172043) internal successors, (299), 186 states have internal predecessors, (299), 3 states have call successors, (3), 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-06 08:41:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 303 transitions. [2022-04-06 08:41:51,670 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 303 transitions. Word has length 66 [2022-04-06 08:41:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:41:51,671 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 303 transitions. [2022-04-06 08:41:51,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 303 transitions. [2022-04-06 08:41:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-06 08:41:51,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:41:51,679 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:41:51,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 08:41:51,695 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:41:51,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:41:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 618911837, now seen corresponding path program 1 times [2022-04-06 08:41:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:41:51,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978625442] [2022-04-06 08:41:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:41:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:41:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:41:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:51,853 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-06 08:41:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:41:51,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978625442] [2022-04-06 08:41:51,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978625442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:41:51,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:41:51,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:41:51,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670078962] [2022-04-06 08:41:51,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:41:51,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:41:51,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:41:51,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:41:51,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:41:51,858 INFO L87 Difference]: Start difference. First operand 191 states and 303 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:53,875 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-06 08:41:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:41:54,245 INFO L93 Difference]: Finished difference Result 303 states and 473 transitions. [2022-04-06 08:41:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:41:54,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-06 08:41:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:41:54,247 INFO L225 Difference]: With dead ends: 303 [2022-04-06 08:41:54,247 INFO L226 Difference]: Without dead ends: 303 [2022-04-06 08:41:54,248 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-06 08:41:54,248 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:41:54,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:41:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-06 08:41:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 202. [2022-04-06 08:41:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.5888324873096447) internal successors, (313), 197 states have internal predecessors, (313), 3 states have call successors, (3), 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-06 08:41:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 317 transitions. [2022-04-06 08:41:54,256 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 317 transitions. Word has length 67 [2022-04-06 08:41:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:41:54,256 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 317 transitions. [2022-04-06 08:41:54,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 317 transitions. [2022-04-06 08:41:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-06 08:41:54,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:41:54,257 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:41:54,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 08:41:54,257 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:41:54,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:41:54,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1511562301, now seen corresponding path program 1 times [2022-04-06 08:41:54,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:41:54,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980820537] [2022-04-06 08:41:54,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:41:54,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:41:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:54,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:41:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:41:54,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:41:54,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980820537] [2022-04-06 08:41:54,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980820537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:41:54,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:41:54,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:41:54,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864849114] [2022-04-06 08:41:54,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:41:54,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:41:54,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:41:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:41:54,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:41:54,383 INFO L87 Difference]: Start difference. First operand 202 states and 317 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:56,393 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-06 08:41:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:41:56,704 INFO L93 Difference]: Finished difference Result 218 states and 336 transitions. [2022-04-06 08:41:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:41:56,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-06 08:41:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:41:56,705 INFO L225 Difference]: With dead ends: 218 [2022-04-06 08:41:56,705 INFO L226 Difference]: Without dead ends: 218 [2022-04-06 08:41:56,706 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-06 08:41:56,706 INFO L913 BasicCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 08:41:56,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 08:41:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-06 08:41:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2022-04-06 08:41:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.583756345177665) internal successors, (312), 197 states have internal predecessors, (312), 3 states have call successors, (3), 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-06 08:41:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 316 transitions. [2022-04-06 08:41:56,712 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 316 transitions. Word has length 67 [2022-04-06 08:41:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:41:56,712 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 316 transitions. [2022-04-06 08:41:56,712 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 316 transitions. [2022-04-06 08:41:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-06 08:41:56,713 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:41:56,713 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:41:56,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 08:41:56,713 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:41:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:41:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash 960701661, now seen corresponding path program 1 times [2022-04-06 08:41:56,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:41:56,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054058960] [2022-04-06 08:41:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:41:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:41:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:41:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:41:56,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:41:56,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054058960] [2022-04-06 08:41:56,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054058960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:41:56,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:41:56,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:41:56,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003577796] [2022-04-06 08:41:56,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:41:56,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:41:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:41:56,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:41:56,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:41:56,840 INFO L87 Difference]: Start difference. First operand 202 states and 316 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:58,859 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-06 08:41:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:41:59,196 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2022-04-06 08:41:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:41:59,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-06 08:41:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:41:59,198 INFO L225 Difference]: With dead ends: 217 [2022-04-06 08:41:59,198 INFO L226 Difference]: Without dead ends: 217 [2022-04-06 08:41:59,198 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-06 08:41:59,198 INFO L913 BasicCegarLoop]: 179 mSDtfsCounter, 19 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 08:41:59,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 457 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 346 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 08:41:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-06 08:41:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2022-04-06 08:41:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.5786802030456852) internal successors, (311), 197 states have internal predecessors, (311), 3 states have call successors, (3), 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-06 08:41:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 315 transitions. [2022-04-06 08:41:59,208 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 315 transitions. Word has length 67 [2022-04-06 08:41:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:41:59,208 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 315 transitions. [2022-04-06 08:41:59,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:41:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 315 transitions. [2022-04-06 08:41:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-06 08:41:59,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:41:59,209 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:41:59,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 08:41:59,209 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:41:59,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:41:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1706608643, now seen corresponding path program 1 times [2022-04-06 08:41:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:41:59,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959843110] [2022-04-06 08:41:59,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:41:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:41:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:41:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:41:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:41:59,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:41:59,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959843110] [2022-04-06 08:41:59,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959843110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:41:59,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:41:59,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:41:59,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587102957] [2022-04-06 08:41:59,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:41:59,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:41:59,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:41:59,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:41:59,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:41:59,303 INFO L87 Difference]: Start difference. First operand 202 states and 315 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:01,316 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-06 08:42:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:01,764 INFO L93 Difference]: Finished difference Result 303 states and 468 transitions. [2022-04-06 08:42:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:01,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-06 08:42:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:01,766 INFO L225 Difference]: With dead ends: 303 [2022-04-06 08:42:01,766 INFO L226 Difference]: Without dead ends: 303 [2022-04-06 08:42:01,766 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-06 08:42:01,766 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 133 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:01,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:42:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-06 08:42:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 208. [2022-04-06 08:42:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 203 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 324 transitions. [2022-04-06 08:42:01,772 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 324 transitions. Word has length 67 [2022-04-06 08:42:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:01,772 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 324 transitions. [2022-04-06 08:42:01,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 324 transitions. [2022-04-06 08:42:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-06 08:42:01,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:01,773 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:01,773 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 08:42:01,773 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash -973479859, now seen corresponding path program 1 times [2022-04-06 08:42:01,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:01,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901205523] [2022-04-06 08:42:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:01,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:42:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:01,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901205523] [2022-04-06 08:42:01,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901205523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:01,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:01,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382011098] [2022-04-06 08:42:01,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:01,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:01,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:01,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:01,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:01,867 INFO L87 Difference]: Start difference. First operand 208 states and 324 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:03,877 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-06 08:42:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:04,328 INFO L93 Difference]: Finished difference Result 303 states and 465 transitions. [2022-04-06 08:42:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-06 08:42:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:04,329 INFO L225 Difference]: With dead ends: 303 [2022-04-06 08:42:04,329 INFO L226 Difference]: Without dead ends: 303 [2022-04-06 08:42:04,330 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-06 08:42:04,330 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 136 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:04,330 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:42:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-06 08:42:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 208. [2022-04-06 08:42:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.561576354679803) internal successors, (317), 203 states have internal predecessors, (317), 3 states have call successors, (3), 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-06 08:42:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 321 transitions. [2022-04-06 08:42:04,335 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 321 transitions. Word has length 68 [2022-04-06 08:42:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:04,335 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 321 transitions. [2022-04-06 08:42:04,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2022-04-06 08:42:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-06 08:42:04,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:04,335 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:04,336 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-06 08:42:04,336 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1662536007, now seen corresponding path program 1 times [2022-04-06 08:42:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:04,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615796895] [2022-04-06 08:42:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:04,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:42:04,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:04,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615796895] [2022-04-06 08:42:04,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615796895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:04,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:04,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:04,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944261533] [2022-04-06 08:42:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:04,433 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:04,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:04,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:04,435 INFO L87 Difference]: Start difference. First operand 208 states and 321 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:06,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-06 08:42:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:06,749 INFO L93 Difference]: Finished difference Result 221 states and 337 transitions. [2022-04-06 08:42:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:06,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-06 08:42:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:06,750 INFO L225 Difference]: With dead ends: 221 [2022-04-06 08:42:06,750 INFO L226 Difference]: Without dead ends: 221 [2022-04-06 08:42:06,750 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-06 08:42:06,751 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:06,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 08:42:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-06 08:42:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 208. [2022-04-06 08:42:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.5566502463054188) internal successors, (316), 203 states have internal predecessors, (316), 3 states have call successors, (3), 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-06 08:42:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 320 transitions. [2022-04-06 08:42:06,754 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 320 transitions. Word has length 69 [2022-04-06 08:42:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:06,755 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 320 transitions. [2022-04-06 08:42:06,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 320 transitions. [2022-04-06 08:42:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-06 08:42:06,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:06,756 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:06,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-06 08:42:06,756 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2024906794, now seen corresponding path program 1 times [2022-04-06 08:42:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:06,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781455252] [2022-04-06 08:42:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:42:06,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:06,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781455252] [2022-04-06 08:42:06,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781455252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:06,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:06,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:06,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644693008] [2022-04-06 08:42:06,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:06,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:06,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:06,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:06,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:06,840 INFO L87 Difference]: Start difference. First operand 208 states and 320 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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-06 08:42:08,856 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-06 08:42:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:09,288 INFO L93 Difference]: Finished difference Result 211 states and 323 transitions. [2022-04-06 08:42:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:09,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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 70 [2022-04-06 08:42:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:09,289 INFO L225 Difference]: With dead ends: 211 [2022-04-06 08:42:09,289 INFO L226 Difference]: Without dead ends: 211 [2022-04-06 08:42:09,290 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-06 08:42:09,290 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:09,290 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 475 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:42:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-06 08:42:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-04-06 08:42:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.5517241379310345) internal successors, (315), 203 states have internal predecessors, (315), 3 states have call successors, (3), 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-06 08:42:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2022-04-06 08:42:09,294 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 70 [2022-04-06 08:42:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:09,295 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2022-04-06 08:42:09,295 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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-06 08:42:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2022-04-06 08:42:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-06 08:42:09,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:09,295 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:09,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-06 08:42:09,296 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash 629002011, now seen corresponding path program 1 times [2022-04-06 08:42:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:09,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995897243] [2022-04-06 08:42:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:09,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:09,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:42:09,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:09,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995897243] [2022-04-06 08:42:09,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995897243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:09,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:09,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:09,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272834108] [2022-04-06 08:42:09,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:09,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:09,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:09,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:09,424 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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-06 08:42:11,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-06 08:42:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:11,786 INFO L93 Difference]: Finished difference Result 250 states and 380 transitions. [2022-04-06 08:42:11,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:11,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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 70 [2022-04-06 08:42:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:11,788 INFO L225 Difference]: With dead ends: 250 [2022-04-06 08:42:11,788 INFO L226 Difference]: Without dead ends: 250 [2022-04-06 08:42:11,788 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 08:42:11,788 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:11,788 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 475 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 08:42:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-06 08:42:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 230. [2022-04-06 08:42:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 225 states have internal predecessors, (350), 3 states have call successors, (3), 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-06 08:42:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2022-04-06 08:42:11,792 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 70 [2022-04-06 08:42:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:11,793 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2022-04-06 08:42:11,793 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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-06 08:42:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2022-04-06 08:42:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-06 08:42:11,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:11,794 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:11,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-06 08:42:11,794 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2007683401, now seen corresponding path program 1 times [2022-04-06 08:42:11,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:11,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933274254] [2022-04-06 08:42:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:11,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:42:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:11,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933274254] [2022-04-06 08:42:11,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933274254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:11,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:11,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46093041] [2022-04-06 08:42:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:11,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:11,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:11,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:11,885 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:13,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-06 08:42:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:14,407 INFO L93 Difference]: Finished difference Result 366 states and 570 transitions. [2022-04-06 08:42:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-06 08:42:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:14,409 INFO L225 Difference]: With dead ends: 366 [2022-04-06 08:42:14,409 INFO L226 Difference]: Without dead ends: 366 [2022-04-06 08:42:14,409 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 08:42:14,410 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 133 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:14,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 536 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 569 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-06 08:42:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-06 08:42:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 246. [2022-04-06 08:42:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5435684647302905) internal successors, (372), 241 states have internal predecessors, (372), 3 states have call successors, (3), 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-06 08:42:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 376 transitions. [2022-04-06 08:42:14,414 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 376 transitions. Word has length 83 [2022-04-06 08:42:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:14,414 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 376 transitions. [2022-04-06 08:42:14,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 376 transitions. [2022-04-06 08:42:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-06 08:42:14,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:14,415 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:14,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-06 08:42:14,415 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1244783807, now seen corresponding path program 1 times [2022-04-06 08:42:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:14,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131031008] [2022-04-06 08:42:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 08:42:14,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:14,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131031008] [2022-04-06 08:42:14,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131031008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:14,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:14,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:14,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824865672] [2022-04-06 08:42:14,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:14,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:14,507 INFO L87 Difference]: Start difference. First operand 246 states and 376 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:16,519 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-06 08:42:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:16,894 INFO L93 Difference]: Finished difference Result 258 states and 390 transitions. [2022-04-06 08:42:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:16,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-06 08:42:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:16,896 INFO L225 Difference]: With dead ends: 258 [2022-04-06 08:42:16,896 INFO L226 Difference]: Without dead ends: 258 [2022-04-06 08:42:16,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 08:42:16,896 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 20 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:16,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 540 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:42:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-06 08:42:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2022-04-06 08:42:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5394190871369295) internal successors, (371), 241 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 375 transitions. [2022-04-06 08:42:16,900 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 375 transitions. Word has length 84 [2022-04-06 08:42:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:16,901 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 375 transitions. [2022-04-06 08:42:16,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 375 transitions. [2022-04-06 08:42:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-06 08:42:16,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:16,901 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 08:42:16,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-06 08:42:16,902 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1795644447, now seen corresponding path program 1 times [2022-04-06 08:42:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:16,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070670580] [2022-04-06 08:42:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:16,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:42:16,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:16,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070670580] [2022-04-06 08:42:16,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070670580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:16,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:16,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:16,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111199633] [2022-04-06 08:42:16,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:16,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:16,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:16,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:16,986 INFO L87 Difference]: Start difference. First operand 246 states and 375 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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-06 08:42:18,999 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-06 08:42:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:19,440 INFO L93 Difference]: Finished difference Result 340 states and 515 transitions. [2022-04-06 08:42:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:19,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 84 [2022-04-06 08:42:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:19,442 INFO L225 Difference]: With dead ends: 340 [2022-04-06 08:42:19,442 INFO L226 Difference]: Without dead ends: 340 [2022-04-06 08:42:19,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 08:42:19,442 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 131 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:19,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 318 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 460 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:42:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-04-06 08:42:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 247. [2022-04-06 08:42:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.5289256198347108) internal successors, (370), 242 states have internal predecessors, (370), 3 states have call successors, (3), 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-06 08:42:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 374 transitions. [2022-04-06 08:42:19,447 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 374 transitions. Word has length 84 [2022-04-06 08:42:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:19,447 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 374 transitions. [2022-04-06 08:42:19,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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-06 08:42:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 374 transitions. [2022-04-06 08:42:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-06 08:42:19,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:19,448 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:19,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-06 08:42:19,448 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:19,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1001549454, now seen corresponding path program 1 times [2022-04-06 08:42:19,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:19,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753315273] [2022-04-06 08:42:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:42:19,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:19,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753315273] [2022-04-06 08:42:19,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753315273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:19,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:19,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019778915] [2022-04-06 08:42:19,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:19,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:19,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:19,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:19,554 INFO L87 Difference]: Start difference. First operand 247 states and 374 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:21,567 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-06 08:42:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:21,907 INFO L93 Difference]: Finished difference Result 264 states and 396 transitions. [2022-04-06 08:42:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:21,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-06 08:42:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:21,908 INFO L225 Difference]: With dead ends: 264 [2022-04-06 08:42:21,908 INFO L226 Difference]: Without dead ends: 264 [2022-04-06 08:42:21,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 08:42:21,911 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 38 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:21,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 481 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 08:42:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-06 08:42:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 247. [2022-04-06 08:42:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.524793388429752) internal successors, (369), 242 states have internal predecessors, (369), 3 states have call successors, (3), 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-06 08:42:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 373 transitions. [2022-04-06 08:42:21,915 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 373 transitions. Word has length 85 [2022-04-06 08:42:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:21,916 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 373 transitions. [2022-04-06 08:42:21,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 373 transitions. [2022-04-06 08:42:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-06 08:42:21,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:21,917 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:21,917 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-06 08:42:21,917 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2108961938, now seen corresponding path program 1 times [2022-04-06 08:42:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:21,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737141828] [2022-04-06 08:42:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:42:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:22,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737141828] [2022-04-06 08:42:22,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737141828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:22,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:22,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65377357] [2022-04-06 08:42:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:22,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:22,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:22,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:22,009 INFO L87 Difference]: Start difference. First operand 247 states and 373 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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-06 08:42:24,023 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-06 08:42:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:24,344 INFO L93 Difference]: Finished difference Result 264 states and 395 transitions. [2022-04-06 08:42:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:24,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 87 [2022-04-06 08:42:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:24,345 INFO L225 Difference]: With dead ends: 264 [2022-04-06 08:42:24,345 INFO L226 Difference]: Without dead ends: 264 [2022-04-06 08:42:24,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 08:42:24,345 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 35 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:24,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 481 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 08:42:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-06 08:42:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 247. [2022-04-06 08:42:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.5206611570247934) internal successors, (368), 242 states have internal predecessors, (368), 3 states have call successors, (3), 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-06 08:42:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 372 transitions. [2022-04-06 08:42:24,349 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 372 transitions. Word has length 87 [2022-04-06 08:42:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:24,349 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 372 transitions. [2022-04-06 08:42:24,350 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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-06 08:42:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 372 transitions. [2022-04-06 08:42:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-06 08:42:24,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:24,350 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:24,350 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-06 08:42:24,350 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1280697289, now seen corresponding path program 1 times [2022-04-06 08:42:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:24,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421206814] [2022-04-06 08:42:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 08:42:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:24,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421206814] [2022-04-06 08:42:24,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421206814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:24,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:24,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141606737] [2022-04-06 08:42:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:24,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:24,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:24,434 INFO L87 Difference]: Start difference. First operand 247 states and 372 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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-06 08:42:26,452 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-06 08:42:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:26,753 INFO L93 Difference]: Finished difference Result 254 states and 381 transitions. [2022-04-06 08:42:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:26,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 88 [2022-04-06 08:42:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:26,754 INFO L225 Difference]: With dead ends: 254 [2022-04-06 08:42:26,755 INFO L226 Difference]: Without dead ends: 254 [2022-04-06 08:42:26,755 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 08:42:26,755 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 26 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:26,755 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 495 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-06 08:42:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-06 08:42:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 247. [2022-04-06 08:42:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.5165289256198347) internal successors, (367), 242 states have internal predecessors, (367), 3 states have call successors, (3), 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-06 08:42:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 371 transitions. [2022-04-06 08:42:26,759 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 371 transitions. Word has length 88 [2022-04-06 08:42:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:26,759 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 371 transitions. [2022-04-06 08:42:26,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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-06 08:42:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 371 transitions. [2022-04-06 08:42:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-06 08:42:26,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:26,760 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:26,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-06 08:42:26,760 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1630403386, now seen corresponding path program 1 times [2022-04-06 08:42:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:26,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102155176] [2022-04-06 08:42:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:26,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-06 08:42:26,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:26,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102155176] [2022-04-06 08:42:26,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102155176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:26,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:26,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337636711] [2022-04-06 08:42:26,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:26,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:26,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:26,888 INFO L87 Difference]: Start difference. First operand 247 states and 371 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:28,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-06 08:42:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:29,284 INFO L93 Difference]: Finished difference Result 338 states and 508 transitions. [2022-04-06 08:42:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:29,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-06 08:42:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:29,285 INFO L225 Difference]: With dead ends: 338 [2022-04-06 08:42:29,285 INFO L226 Difference]: Without dead ends: 338 [2022-04-06 08:42:29,285 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-06 08:42:29,286 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 71 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:29,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 439 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 497 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:42:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-06 08:42:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 290. [2022-04-06 08:42:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 285 states have (on average 1.543859649122807) internal successors, (440), 285 states have internal predecessors, (440), 3 states have call successors, (3), 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-06 08:42:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 444 transitions. [2022-04-06 08:42:29,290 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 444 transitions. Word has length 92 [2022-04-06 08:42:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:29,290 INFO L478 AbstractCegarLoop]: Abstraction has 290 states and 444 transitions. [2022-04-06 08:42:29,290 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 444 transitions. [2022-04-06 08:42:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-06 08:42:29,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:29,291 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:29,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-06 08:42:29,291 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash 605709465, now seen corresponding path program 1 times [2022-04-06 08:42:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:29,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467235488] [2022-04-06 08:42:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:29,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-06 08:42:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:29,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467235488] [2022-04-06 08:42:29,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467235488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:29,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:29,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968862972] [2022-04-06 08:42:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:29,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:29,380 INFO L87 Difference]: Start difference. First operand 290 states and 444 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:31,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-06 08:42:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:31,817 INFO L93 Difference]: Finished difference Result 383 states and 584 transitions. [2022-04-06 08:42:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:31,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-06 08:42:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:31,819 INFO L225 Difference]: With dead ends: 383 [2022-04-06 08:42:31,819 INFO L226 Difference]: Without dead ends: 381 [2022-04-06 08:42:31,819 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-06 08:42:31,819 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 105 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:31,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 328 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:42:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-06 08:42:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 314. [2022-04-06 08:42:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5760517799352751) internal successors, (487), 309 states have internal predecessors, (487), 3 states have call successors, (3), 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-06 08:42:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 491 transitions. [2022-04-06 08:42:31,824 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 491 transitions. Word has length 92 [2022-04-06 08:42:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:31,824 INFO L478 AbstractCegarLoop]: Abstraction has 314 states and 491 transitions. [2022-04-06 08:42:31,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 491 transitions. [2022-04-06 08:42:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-06 08:42:31,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:31,825 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:31,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-06 08:42:31,825 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash -908174334, now seen corresponding path program 1 times [2022-04-06 08:42:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:31,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247785024] [2022-04-06 08:42:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-06 08:42:31,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:31,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247785024] [2022-04-06 08:42:31,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247785024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:31,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:31,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 08:42:31,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007835247] [2022-04-06 08:42:31,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:31,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 08:42:31,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:31,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 08:42:31,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 08:42:31,979 INFO L87 Difference]: Start difference. First operand 314 states and 491 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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-06 08:42:33,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-06 08:42:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:34,392 INFO L93 Difference]: Finished difference Result 420 states and 647 transitions. [2022-04-06 08:42:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 08:42:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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 120 [2022-04-06 08:42:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:34,394 INFO L225 Difference]: With dead ends: 420 [2022-04-06 08:42:34,394 INFO L226 Difference]: Without dead ends: 420 [2022-04-06 08:42:34,394 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-06 08:42:34,395 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 113 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:34,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 330 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 452 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:42:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-06 08:42:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 346. [2022-04-06 08:42:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 341 states have (on average 1.5777126099706744) internal successors, (538), 341 states have internal predecessors, (538), 3 states have call successors, (3), 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-06 08:42:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 542 transitions. [2022-04-06 08:42:34,399 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 542 transitions. Word has length 120 [2022-04-06 08:42:34,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:34,400 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 542 transitions. [2022-04-06 08:42:34,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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-06 08:42:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 542 transitions. [2022-04-06 08:42:34,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-06 08:42:34,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:34,401 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:34,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-06 08:42:34,401 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1100699172, now seen corresponding path program 1 times [2022-04-06 08:42:34,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:34,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043278861] [2022-04-06 08:42:34,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:34,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 08:42:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 08:42:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-06 08:42:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 08:42:34,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043278861] [2022-04-06 08:42:34,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043278861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 08:42:34,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 08:42:34,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 08:42:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515593639] [2022-04-06 08:42:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 08:42:34,742 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 08:42:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 08:42:34,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 08:42:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-06 08:42:34,743 INFO L87 Difference]: Start difference. First operand 346 states and 542 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:36,754 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-06 08:42:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 08:42:37,179 INFO L93 Difference]: Finished difference Result 354 states and 552 transitions. [2022-04-06 08:42:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 08:42:37,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-06 08:42:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 08:42:37,181 INFO L225 Difference]: With dead ends: 354 [2022-04-06 08:42:37,181 INFO L226 Difference]: Without dead ends: 346 [2022-04-06 08:42:37,181 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-06 08:42:37,181 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-06 08:42:37,181 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 791 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-06 08:42:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-04-06 08:42:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-04-06 08:42:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 341 states have (on average 1.5747800586510263) internal successors, (537), 341 states have internal predecessors, (537), 3 states have call successors, (3), 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-06 08:42:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 541 transitions. [2022-04-06 08:42:37,186 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 541 transitions. Word has length 132 [2022-04-06 08:42:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 08:42:37,186 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 541 transitions. [2022-04-06 08:42:37,186 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 08:42:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 541 transitions. [2022-04-06 08:42:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-06 08:42:37,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 08:42:37,187 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:37,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-06 08:42:37,187 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 08:42:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 08:42:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash 885870019, now seen corresponding path program 1 times [2022-04-06 08:42:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 08:42:37,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973728090] [2022-04-06 08:42:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 08:42:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 08:42:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 08:42:37,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-06 08:42:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 08:42:37,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-06 08:42:37,719 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-06 08:42:37,720 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 08:42:37,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-06 08:42:37,724 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 08:42:37,728 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 08:42:37,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 08:42:37 BasicIcfg [2022-04-06 08:42:37,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 08:42:37,837 INFO L158 Benchmark]: Toolchain (without parser) took 57843.16ms. Allocated memory was 194.0MB in the beginning and 257.9MB in the end (delta: 64.0MB). Free memory was 171.4MB in the beginning and 165.9MB in the end (delta: 5.5MB). Peak memory consumption was 161.4MB. Max. memory is 8.0GB. [2022-04-06 08:42:37,837 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 08:42:37,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.32ms. Allocated memory is still 194.0MB. Free memory was 171.1MB in the beginning and 148.8MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-04-06 08:42:37,838 INFO L158 Benchmark]: Boogie Preprocessor took 78.32ms. Allocated memory is still 194.0MB. Free memory was 148.8MB in the beginning and 141.3MB in the end (delta: 7.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-06 08:42:37,838 INFO L158 Benchmark]: RCFGBuilder took 2780.36ms. Allocated memory is still 194.0MB. Free memory was 141.0MB in the beginning and 103.5MB in the end (delta: 37.5MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. [2022-04-06 08:42:37,838 INFO L158 Benchmark]: IcfgTransformer took 61.34ms. Allocated memory was 194.0MB in the beginning and 257.9MB in the end (delta: 64.0MB). Free memory was 103.5MB in the beginning and 223.7MB in the end (delta: -120.2MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-04-06 08:42:37,839 INFO L158 Benchmark]: TraceAbstraction took 54548.75ms. Allocated memory is still 257.9MB. Free memory was 223.2MB in the beginning and 165.9MB in the end (delta: 57.3MB). Peak memory consumption was 150.0MB. Max. memory is 8.0GB. [2022-04-06 08:42:37,840 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 370.32ms. Allocated memory is still 194.0MB. Free memory was 171.1MB in the beginning and 148.8MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.32ms. Allocated memory is still 194.0MB. Free memory was 148.8MB in the beginning and 141.3MB in the end (delta: 7.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2780.36ms. Allocated memory is still 194.0MB. Free memory was 141.0MB in the beginning and 103.5MB in the end (delta: 37.5MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. * IcfgTransformer took 61.34ms. Allocated memory was 194.0MB in the beginning and 257.9MB in the end (delta: 64.0MB). Free memory was 103.5MB in the beginning and 223.7MB in the end (delta: -120.2MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * TraceAbstraction took 54548.75ms. Allocated memory is still 257.9MB. Free memory was 223.2MB in the beginning and 165.9MB in the end (delta: 57.3MB). Peak memory consumption was 150.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1733]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967301, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) VAL [init=1, s={-4294967298:0}, SSLv3_server_data={4:0}] [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->info_callback={0:-2}, skip=0, SSLv3_server_data={4:0}, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] EXPR s->cert VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967298:0}, s={-4294967298:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-2}, blastFlag=1, got_new_session=0, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2}, (s->s3)->tmp.reuse_message=4294967326, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->hit=8, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1388] s->init_num = 0 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2}, (s->s3)->tmp.reuse_message=4294967326, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967298:0}, s={-4294967298:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND TRUE s->state == 8656 [L1581] EXPR s->session [L1581] EXPR s->s3 [L1581] EXPR (s->s3)->tmp.new_cipher [L1581] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1582] COND FALSE !(! tmp___9) [L1588] ret = __VERIFIER_nondet_int() [L1589] COND TRUE blastFlag == 2 [L1590] blastFlag = 4 VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1605] COND FALSE !(! tmp___10) VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2}, (s->s3)->tmp.reuse_message=4294967326, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=17, s={-4294967298:0}, s={-4294967298:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 4 VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=0, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1733] reach_error() VAL [={0:-2}, blastFlag=4, got_new_session=1, init=1, ret=0, s={-4294967298:0}, s={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=9, tmp=9, tmp___1=1, tmp___10=7, tmp___2=10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.4s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 50.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 1379 SdHoareTripleChecker+Valid, 50.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1379 mSDsluCounter, 9347 SdHoareTripleChecker+Invalid, 48.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5891 mSDsCounter, 578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8716 IncrementalHoareTripleChecker+Invalid, 9315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 578 mSolverCounterUnsat, 3456 mSDtfsCounter, 8716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=20, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 917 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1795 NumberOfCodeBlocks, 1795 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1642 ConstructedInterpolants, 0 QuantifiedInterpolants, 4952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 500/500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-06 08:42:37,883 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...