/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.09.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 16:22:23,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 16:22:23,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 16:22:23,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 16:22:23,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 16:22:23,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 16:22:23,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 16:22:23,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 16:22:23,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 16:22:23,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 16:22:23,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 16:22:23,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 16:22:23,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 16:22:23,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 16:22:23,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 16:22:23,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 16:22:23,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 16:22:23,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 16:22:23,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 16:22:23,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 16:22:23,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 16:22:23,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 16:22:23,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 16:22:23,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 16:22:23,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 16:22:23,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 16:22:23,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 16:22:23,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 16:22:23,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 16:22:23,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 16:22:23,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 16:22:23,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 16:22:23,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 16:22:23,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 16:22:23,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 16:22:23,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 16:22:23,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 16:22:23,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 16:22:23,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 16:22:23,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 16:22:23,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 16:22:23,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 16:22:23,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 16:22:23,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 16:22:23,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 16:22:23,568 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 16:22:23,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 16:22:23,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 16:22:23,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 16:22:23,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 16:22:23,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 16:22:23,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 16:22:23,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 16:22:23,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 16:22:23,569 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 16:22:23,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 16:22:23,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 16:22:23,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 16:22:23,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 16:22:23,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 16:22:23,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:22:23,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 16:22:23,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 16:22:23,571 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 16:22:23,571 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-01-31 16:22:23,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 16:22:23,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 16:22:23,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 16:22:23,828 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 16:22:23,829 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 16:22:23,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-1.c [2022-01-31 16:22:23,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a65a767f3/bf0ca7d3f4cd4dc491db612396fc1ea5/FLAG4ecb9e4c8 [2022-01-31 16:22:24,331 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 16:22:24,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-1.c [2022-01-31 16:22:24,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a65a767f3/bf0ca7d3f4cd4dc491db612396fc1ea5/FLAG4ecb9e4c8 [2022-01-31 16:22:24,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a65a767f3/bf0ca7d3f4cd4dc491db612396fc1ea5 [2022-01-31 16:22:24,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 16:22:24,386 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 16:22:24,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 16:22:24,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 16:22:24,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 16:22:24,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:24,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223e076e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24, skipping insertion in model container [2022-01-31 16:22:24,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:24,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 16:22:24,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 16:22:24,814 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.09.i.cil-1.c[74369,74382] [2022-01-31 16:22:24,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:22:24,833 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 16:22:24,912 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.09.i.cil-1.c[74369,74382] [2022-01-31 16:22:24,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:22:24,932 INFO L208 MainTranslator]: Completed translation [2022-01-31 16:22:24,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24 WrapperNode [2022-01-31 16:22:24,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 16:22:24,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 16:22:24,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 16:22:24,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 16:22:24,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:24,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:24,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:24,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:25,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:25,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:25,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:25,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 16:22:25,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 16:22:25,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 16:22:25,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 16:22:25,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24" (1/1) ... [2022-01-31 16:22:25,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:22:25,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:22:25,133 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-01-31 16:22:25,141 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-01-31 16:22:25,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 16:22:25,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 16:22:25,166 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 16:22:25,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-01-31 16:22:25,166 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-01-31 16:22:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 16:22:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-01-31 16:22:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-01-31 16:22:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-01-31 16:22:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-01-31 16:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 16:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 16:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 16:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 16:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 16:22:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 16:22:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 16:22:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 16:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-01-31 16:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-01-31 16:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 16:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 16:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 16:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-01-31 16:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-01-31 16:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-01-31 16:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-01-31 16:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 16:22:25,322 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 16:22:25,323 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 16:22:26,005 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:22:26,412 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-01-31 16:22:26,412 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-01-31 16:22:26,421 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 16:22:26,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 16:22:26,427 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 16:22:26,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:22:26 BoogieIcfgContainer [2022-01-31 16:22:26,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 16:22:26,429 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 16:22:26,429 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 16:22:26,444 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 16:22:26,446 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:22:26" (1/1) ... [2022-01-31 16:22:26,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:22:26 BasicIcfg [2022-01-31 16:22:26,510 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 16:22:26,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 16:22:26,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 16:22:26,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 16:22:26,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:22:24" (1/4) ... [2022-01-31 16:22:26,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3223d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:22:26, skipping insertion in model container [2022-01-31 16:22:26,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:22:24" (2/4) ... [2022-01-31 16:22:26,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3223d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:22:26, skipping insertion in model container [2022-01-31 16:22:26,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:22:26" (3/4) ... [2022-01-31 16:22:26,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3223d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:22:26, skipping insertion in model container [2022-01-31 16:22:26,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:22:26" (4/4) ... [2022-01-31 16:22:26,515 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.cJordan [2022-01-31 16:22:26,519 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 16:22:26,519 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 16:22:26,558 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 16:22:26,564 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 16:22:26,565 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 16:22:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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-01-31 16:22:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 16:22:26,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:22:26,596 INFO L514 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] [2022-01-31 16:22:26,597 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:22:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:22:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1099342272, now seen corresponding path program 1 times [2022-01-31 16:22:26,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:22:26,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762150828] [2022-01-31 16:22:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:22:26,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:22:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:27,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:22:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:22:27,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:22:27,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762150828] [2022-01-31 16:22:27,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762150828] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:22:27,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:22:27,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:22:27,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7565517] [2022-01-31 16:22:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:22:27,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:22:27,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:22:27,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:22:27,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:22:27,064 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-01-31 16:22:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:22:29,843 INFO L93 Difference]: Finished difference Result 191 states and 312 transitions. [2022-01-31 16:22:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:22:29,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 42 [2022-01-31 16:22:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:22:29,852 INFO L225 Difference]: With dead ends: 191 [2022-01-31 16:22:29,853 INFO L226 Difference]: Without dead ends: 170 [2022-01-31 16:22:29,854 INFO L932 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-01-31 16:22:29,858 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 34 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:22:29,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 607 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-01-31 16:22:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-01-31 16:22:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2022-01-31 16:22:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.554054054054054) internal successors, (230), 148 states have internal predecessors, (230), 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-01-31 16:22:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 234 transitions. [2022-01-31 16:22:29,892 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 234 transitions. Word has length 42 [2022-01-31 16:22:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:22:29,893 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 234 transitions. [2022-01-31 16:22:29,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-01-31 16:22:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 234 transitions. [2022-01-31 16:22:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 16:22:29,894 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:22:29,894 INFO L514 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] [2022-01-31 16:22:29,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 16:22:29,895 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:22:29,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:22:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1972024210, now seen corresponding path program 1 times [2022-01-31 16:22:29,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:22:29,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416428525] [2022-01-31 16:22:29,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:22:29,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:22:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:22:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:22:30,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:22:30,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416428525] [2022-01-31 16:22:30,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416428525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:22:30,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:22:30,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:22:30,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117822557] [2022-01-31 16:22:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:22:30,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:22:30,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:22:30,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:22:30,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:22:30,024 INFO L87 Difference]: Start difference. First operand 153 states and 234 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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-01-31 16:22:31,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:33,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:35,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:37,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:22:37,753 INFO L93 Difference]: Finished difference Result 272 states and 418 transitions. [2022-01-31 16:22:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:22:37,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 55 [2022-01-31 16:22:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:22:37,755 INFO L225 Difference]: With dead ends: 272 [2022-01-31 16:22:37,755 INFO L226 Difference]: Without dead ends: 272 [2022-01-31 16:22:37,755 INFO L932 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-01-31 16:22:37,756 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 147 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 46 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:22:37,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 634 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 624 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-01-31 16:22:37,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-01-31 16:22:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 169. [2022-01-31 16:22:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 164 states have internal predecessors, (255), 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-01-31 16:22:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 259 transitions. [2022-01-31 16:22:37,771 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 259 transitions. Word has length 55 [2022-01-31 16:22:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:22:37,771 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 259 transitions. [2022-01-31 16:22:37,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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-01-31 16:22:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 259 transitions. [2022-01-31 16:22:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 16:22:37,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:22:37,779 INFO L514 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] [2022-01-31 16:22:37,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 16:22:37,780 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:22:37,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:22:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1748095558, now seen corresponding path program 1 times [2022-01-31 16:22:37,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:22:37,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061656303] [2022-01-31 16:22:37,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:22:37,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:22:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:37,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:22:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:22:37,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:22:37,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061656303] [2022-01-31 16:22:37,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061656303] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:22:37,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:22:37,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:22:37,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807884686] [2022-01-31 16:22:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:22:37,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:22:37,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:22:37,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:22:37,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:22:37,953 INFO L87 Difference]: Start difference. First operand 169 states and 259 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-01-31 16:22:39,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:22:40,835 INFO L93 Difference]: Finished difference Result 185 states and 278 transitions. [2022-01-31 16:22:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:22:40,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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 56 [2022-01-31 16:22:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:22:40,837 INFO L225 Difference]: With dead ends: 185 [2022-01-31 16:22:40,837 INFO L226 Difference]: Without dead ends: 185 [2022-01-31 16:22:40,837 INFO L932 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-01-31 16:22:40,838 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:22:40,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 485 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-01-31 16:22:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-01-31 16:22:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 169. [2022-01-31 16:22:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.548780487804878) internal successors, (254), 164 states have internal predecessors, (254), 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-01-31 16:22:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2022-01-31 16:22:40,851 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 56 [2022-01-31 16:22:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:22:40,851 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2022-01-31 16:22:40,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-01-31 16:22:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2022-01-31 16:22:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 16:22:40,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:22:40,852 INFO L514 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] [2022-01-31 16:22:40,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 16:22:40,852 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:22:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:22:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1209199142, now seen corresponding path program 1 times [2022-01-31 16:22:40,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:22:40,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129989647] [2022-01-31 16:22:40,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:22:40,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:22:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:40,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:22:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:22:40,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:22:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129989647] [2022-01-31 16:22:40,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129989647] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:22:40,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:22:40,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:22:40,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000901223] [2022-01-31 16:22:40,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:22:40,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:22:40,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:22:40,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:22:40,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:22:40,974 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-01-31 16:22:43,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:44,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:22:45,303 INFO L93 Difference]: Finished difference Result 185 states and 277 transitions. [2022-01-31 16:22:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:22:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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 56 [2022-01-31 16:22:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:22:45,304 INFO L225 Difference]: With dead ends: 185 [2022-01-31 16:22:45,304 INFO L226 Difference]: Without dead ends: 185 [2022-01-31 16:22:45,305 INFO L932 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-01-31 16:22:45,305 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 26 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:22:45,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 485 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-01-31 16:22:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-01-31 16:22:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 169. [2022-01-31 16:22:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5426829268292683) internal successors, (253), 164 states have internal predecessors, (253), 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-01-31 16:22:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 257 transitions. [2022-01-31 16:22:45,312 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 257 transitions. Word has length 56 [2022-01-31 16:22:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:22:45,313 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 257 transitions. [2022-01-31 16:22:45,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-01-31 16:22:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2022-01-31 16:22:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 16:22:45,313 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:22:45,313 INFO L514 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] [2022-01-31 16:22:45,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 16:22:45,314 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:22:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:22:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1966452198, now seen corresponding path program 1 times [2022-01-31 16:22:45,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:22:45,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808522102] [2022-01-31 16:22:45,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:22:45,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:22:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:22:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:22:45,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:22:45,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808522102] [2022-01-31 16:22:45,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808522102] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:22:45,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:22:45,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:22:45,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748030951] [2022-01-31 16:22:45,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:22:45,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:22:45,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:22:45,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:22:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:22:45,438 INFO L87 Difference]: Start difference. First operand 169 states and 257 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-01-31 16:22:47,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:48,989 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:51,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:22:51,338 INFO L93 Difference]: Finished difference Result 183 states and 274 transitions. [2022-01-31 16:22:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:22:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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 56 [2022-01-31 16:22:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:22:51,340 INFO L225 Difference]: With dead ends: 183 [2022-01-31 16:22:51,340 INFO L226 Difference]: Without dead ends: 183 [2022-01-31 16:22:51,340 INFO L932 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-01-31 16:22:51,340 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:22:51,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 357 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-01-31 16:22:51,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-01-31 16:22:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2022-01-31 16:22:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5365853658536586) internal successors, (252), 164 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:22:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 256 transitions. [2022-01-31 16:22:51,346 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 256 transitions. Word has length 56 [2022-01-31 16:22:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:22:51,346 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 256 transitions. [2022-01-31 16:22:51,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-01-31 16:22:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 256 transitions. [2022-01-31 16:22:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 16:22:51,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:22:51,347 INFO L514 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] [2022-01-31 16:22:51,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 16:22:51,347 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:22:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:22:51,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1979822394, now seen corresponding path program 1 times [2022-01-31 16:22:51,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:22:51,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928845667] [2022-01-31 16:22:51,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:22:51,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:22:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:51,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:22:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:22:51,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:22:51,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928845667] [2022-01-31 16:22:51,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928845667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:22:51,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:22:51,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:22:51,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71408563] [2022-01-31 16:22:51,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:22:51,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:22:51,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:22:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:22:51,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:22:51,454 INFO L87 Difference]: Start difference. First operand 169 states and 256 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-01-31 16:22:54,385 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-01-31 16:22:55,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:22:55,909 INFO L93 Difference]: Finished difference Result 287 states and 439 transitions. [2022-01-31 16:22:55,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:22:55,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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 56 [2022-01-31 16:22:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:22:55,910 INFO L225 Difference]: With dead ends: 287 [2022-01-31 16:22:55,911 INFO L226 Difference]: Without dead ends: 287 [2022-01-31 16:22:55,911 INFO L932 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-01-31 16:22:55,911 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 145 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:22:55,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 344 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-01-31 16:22:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-01-31 16:22:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 187. [2022-01-31 16:22:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.543956043956044) internal successors, (281), 182 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-01-31 16:22:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 285 transitions. [2022-01-31 16:22:55,917 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 285 transitions. Word has length 56 [2022-01-31 16:22:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:22:55,917 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 285 transitions. [2022-01-31 16:22:55,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-01-31 16:22:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 285 transitions. [2022-01-31 16:22:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 16:22:55,918 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:22:55,918 INFO L514 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] [2022-01-31 16:22:55,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 16:22:55,918 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:22:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:22:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1222198510, now seen corresponding path program 1 times [2022-01-31 16:22:55,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:22:55,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540157919] [2022-01-31 16:22:55,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:22:55,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:22:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:22:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:22:56,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:22:56,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540157919] [2022-01-31 16:22:56,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540157919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:22:56,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:22:56,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:22:56,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701603371] [2022-01-31 16:22:56,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:22:56,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:22:56,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:22:56,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:22:56,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:22:56,009 INFO L87 Difference]: Start difference. First operand 187 states and 285 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-01-31 16:22:58,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:22:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:22:59,008 INFO L93 Difference]: Finished difference Result 287 states and 436 transitions. [2022-01-31 16:22:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:22:59,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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 57 [2022-01-31 16:22:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:22:59,009 INFO L225 Difference]: With dead ends: 287 [2022-01-31 16:22:59,009 INFO L226 Difference]: Without dead ends: 287 [2022-01-31 16:22:59,010 INFO L932 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-01-31 16:22:59,010 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 149 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:22:59,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 344 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-31 16:22:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-01-31 16:22:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 187. [2022-01-31 16:22:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.5274725274725274) internal successors, (278), 182 states have internal predecessors, (278), 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-01-31 16:22:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 282 transitions. [2022-01-31 16:22:59,015 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 282 transitions. Word has length 57 [2022-01-31 16:22:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:22:59,015 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 282 transitions. [2022-01-31 16:22:59,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-01-31 16:22:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 282 transitions. [2022-01-31 16:22:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 16:22:59,016 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:22:59,016 INFO L514 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] [2022-01-31 16:22:59,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 16:22:59,016 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:22:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:22:59,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1020945954, now seen corresponding path program 1 times [2022-01-31 16:22:59,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:22:59,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812490402] [2022-01-31 16:22:59,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:22:59,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:22:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:22:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:22:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:22:59,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:22:59,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812490402] [2022-01-31 16:22:59,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812490402] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:22:59,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:22:59,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:22:59,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214578840] [2022-01-31 16:22:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:22:59,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:22:59,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:22:59,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:22:59,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:22:59,124 INFO L87 Difference]: Start difference. First operand 187 states and 282 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-01-31 16:23:01,893 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-01-31 16:23:03,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:03,904 INFO L93 Difference]: Finished difference Result 200 states and 298 transitions. [2022-01-31 16:23:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:23:03,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 58 [2022-01-31 16:23:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:03,905 INFO L225 Difference]: With dead ends: 200 [2022-01-31 16:23:03,905 INFO L226 Difference]: Without dead ends: 200 [2022-01-31 16:23:03,905 INFO L932 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-01-31 16:23:03,906 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 20 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:03,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 355 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-01-31 16:23:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-01-31 16:23:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2022-01-31 16:23:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.521978021978022) internal successors, (277), 182 states have internal predecessors, (277), 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-01-31 16:23:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 281 transitions. [2022-01-31 16:23:03,910 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 281 transitions. Word has length 58 [2022-01-31 16:23:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:03,910 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 281 transitions. [2022-01-31 16:23:03,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-01-31 16:23:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 281 transitions. [2022-01-31 16:23:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 16:23:03,910 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:03,910 INFO L514 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] [2022-01-31 16:23:03,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 16:23:03,911 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1845134763, now seen corresponding path program 1 times [2022-01-31 16:23:03,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:03,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348328380] [2022-01-31 16:23:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:03,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:03,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:23:04,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:04,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348328380] [2022-01-31 16:23:04,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348328380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:04,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:04,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:23:04,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733043367] [2022-01-31 16:23:04,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:04,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:23:04,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:04,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:23:04,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:23:04,004 INFO L87 Difference]: Start difference. First operand 187 states and 281 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-01-31 16:23:05,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:07,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:09,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:09,384 INFO L93 Difference]: Finished difference Result 190 states and 284 transitions. [2022-01-31 16:23:09,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:23:09,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 59 [2022-01-31 16:23:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:09,386 INFO L225 Difference]: With dead ends: 190 [2022-01-31 16:23:09,386 INFO L226 Difference]: Without dead ends: 190 [2022-01-31 16:23:09,386 INFO L932 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-01-31 16:23:09,387 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:09,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-01-31 16:23:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-01-31 16:23:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2022-01-31 16:23:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.5164835164835164) internal successors, (276), 182 states have internal predecessors, (276), 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-01-31 16:23:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 280 transitions. [2022-01-31 16:23:09,391 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 280 transitions. Word has length 59 [2022-01-31 16:23:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:09,391 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 280 transitions. [2022-01-31 16:23:09,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-01-31 16:23:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 280 transitions. [2022-01-31 16:23:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 16:23:09,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:09,392 INFO L514 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] [2022-01-31 16:23:09,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 16:23:09,392 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:09,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1478412284, now seen corresponding path program 1 times [2022-01-31 16:23:09,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:09,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21805785] [2022-01-31 16:23:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:09,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:09,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:23:09,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:09,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21805785] [2022-01-31 16:23:09,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21805785] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:09,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:09,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:23:09,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672307390] [2022-01-31 16:23:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:09,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:23:09,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:09,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:23:09,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:23:09,483 INFO L87 Difference]: Start difference. First operand 187 states and 280 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-01-31 16:23:11,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:13,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:14,435 INFO L93 Difference]: Finished difference Result 305 states and 461 transitions. [2022-01-31 16:23:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:23:14,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 59 [2022-01-31 16:23:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:14,437 INFO L225 Difference]: With dead ends: 305 [2022-01-31 16:23:14,437 INFO L226 Difference]: Without dead ends: 305 [2022-01-31 16:23:14,437 INFO L932 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-01-31 16:23:14,439 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 134 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:14,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 344 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-01-31 16:23:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-01-31 16:23:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 215. [2022-01-31 16:23:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.5380952380952382) internal successors, (323), 210 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:23:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 327 transitions. [2022-01-31 16:23:14,456 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 327 transitions. Word has length 59 [2022-01-31 16:23:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:14,456 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 327 transitions. [2022-01-31 16:23:14,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-01-31 16:23:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 327 transitions. [2022-01-31 16:23:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 16:23:14,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:14,457 INFO L514 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] [2022-01-31 16:23:14,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 16:23:14,457 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:14,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash 478953171, now seen corresponding path program 1 times [2022-01-31 16:23:14,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:14,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141546841] [2022-01-31 16:23:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:14,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:14,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:23:14,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:14,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141546841] [2022-01-31 16:23:14,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141546841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:14,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:14,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:23:14,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646959623] [2022-01-31 16:23:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:14,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:23:14,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:14,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:23:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:23:14,564 INFO L87 Difference]: Start difference. First operand 215 states and 327 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-01-31 16:23:17,043 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-01-31 16:23:18,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:20,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:21,011 INFO L93 Difference]: Finished difference Result 257 states and 388 transitions. [2022-01-31 16:23:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:23:21,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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 60 [2022-01-31 16:23:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:21,013 INFO L225 Difference]: With dead ends: 257 [2022-01-31 16:23:21,013 INFO L226 Difference]: Without dead ends: 257 [2022-01-31 16:23:21,013 INFO L932 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-01-31 16:23:21,014 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 31 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:21,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 505 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-01-31 16:23:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-01-31 16:23:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 237. [2022-01-31 16:23:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.543103448275862) internal successors, (358), 232 states have internal predecessors, (358), 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-01-31 16:23:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 362 transitions. [2022-01-31 16:23:21,018 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 362 transitions. Word has length 60 [2022-01-31 16:23:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:21,018 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 362 transitions. [2022-01-31 16:23:21,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-01-31 16:23:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 362 transitions. [2022-01-31 16:23:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-31 16:23:21,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:21,019 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:23:21,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 16:23:21,019 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1095309927, now seen corresponding path program 1 times [2022-01-31 16:23:21,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:21,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944557009] [2022-01-31 16:23:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:21,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 16:23:21,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:21,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944557009] [2022-01-31 16:23:21,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944557009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:21,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:21,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:23:21,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353149876] [2022-01-31 16:23:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:21,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:23:21,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:23:21,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:23:21,104 INFO L87 Difference]: Start difference. First operand 237 states and 362 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-01-31 16:23:22,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:25,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:25,609 INFO L93 Difference]: Finished difference Result 250 states and 377 transitions. [2022-01-31 16:23:25,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:23:25,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 74 [2022-01-31 16:23:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:25,610 INFO L225 Difference]: With dead ends: 250 [2022-01-31 16:23:25,610 INFO L226 Difference]: Without dead ends: 250 [2022-01-31 16:23:25,610 INFO L932 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-01-31 16:23:25,611 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 21 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:25,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 576 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-01-31 16:23:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-01-31 16:23:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 237. [2022-01-31 16:23:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.5387931034482758) internal successors, (357), 232 states have internal predecessors, (357), 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-01-31 16:23:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 361 transitions. [2022-01-31 16:23:25,615 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 361 transitions. Word has length 74 [2022-01-31 16:23:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:25,615 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 361 transitions. [2022-01-31 16:23:25,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-01-31 16:23:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 361 transitions. [2022-01-31 16:23:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-31 16:23:25,616 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:25,616 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:23:25,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 16:23:25,616 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash 725568825, now seen corresponding path program 1 times [2022-01-31 16:23:25,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:25,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494956588] [2022-01-31 16:23:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:25,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:23:25,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:25,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494956588] [2022-01-31 16:23:25,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494956588] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:25,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:25,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:23:25,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459277496] [2022-01-31 16:23:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:25,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:23:25,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:23:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:23:25,694 INFO L87 Difference]: Start difference. First operand 237 states and 361 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 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-01-31 16:23:26,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:28,739 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-01-31 16:23:30,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:31,314 INFO L93 Difference]: Finished difference Result 255 states and 384 transitions. [2022-01-31 16:23:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:23:31,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 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 74 [2022-01-31 16:23:31,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:31,316 INFO L225 Difference]: With dead ends: 255 [2022-01-31 16:23:31,316 INFO L226 Difference]: Without dead ends: 255 [2022-01-31 16:23:31,316 INFO L932 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-01-31 16:23:31,316 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 35 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:31,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 509 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-01-31 16:23:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-31 16:23:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 237. [2022-01-31 16:23:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.5344827586206897) internal successors, (356), 232 states have internal predecessors, (356), 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-01-31 16:23:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 360 transitions. [2022-01-31 16:23:31,320 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 360 transitions. Word has length 74 [2022-01-31 16:23:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:31,320 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 360 transitions. [2022-01-31 16:23:31,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 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-01-31 16:23:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 360 transitions. [2022-01-31 16:23:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-31 16:23:31,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:31,321 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:23:31,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 16:23:31,321 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:31,321 INFO L85 PathProgramCache]: Analyzing trace with hash -409272786, now seen corresponding path program 1 times [2022-01-31 16:23:31,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:31,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775695142] [2022-01-31 16:23:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:31,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 16:23:31,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:31,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775695142] [2022-01-31 16:23:31,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775695142] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:31,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:31,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:23:31,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089045496] [2022-01-31 16:23:31,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:31,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:23:31,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:23:31,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:23:31,442 INFO L87 Difference]: Start difference. First operand 237 states and 360 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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-01-31 16:23:32,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:34,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:36,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:38,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:38,797 INFO L93 Difference]: Finished difference Result 246 states and 371 transitions. [2022-01-31 16:23:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:23:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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 75 [2022-01-31 16:23:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:38,799 INFO L225 Difference]: With dead ends: 246 [2022-01-31 16:23:38,799 INFO L226 Difference]: Without dead ends: 246 [2022-01-31 16:23:38,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:23:38,799 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 3 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:38,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 633 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 434 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-01-31 16:23:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-01-31 16:23:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-01-31 16:23:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5228215767634854) internal successors, (367), 241 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-01-31 16:23:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 371 transitions. [2022-01-31 16:23:38,803 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 371 transitions. Word has length 75 [2022-01-31 16:23:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:38,803 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 371 transitions. [2022-01-31 16:23:38,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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-01-31 16:23:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 371 transitions. [2022-01-31 16:23:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-31 16:23:38,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:38,804 INFO L514 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] [2022-01-31 16:23:38,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 16:23:38,804 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2074107470, now seen corresponding path program 1 times [2022-01-31 16:23:38,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:38,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827023880] [2022-01-31 16:23:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:38,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:23:38,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:38,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827023880] [2022-01-31 16:23:38,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827023880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:38,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:38,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:23:38,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18025790] [2022-01-31 16:23:38,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:38,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:23:38,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:38,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:23:38,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:23:38,879 INFO L87 Difference]: Start difference. First operand 246 states and 371 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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-01-31 16:23:40,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:41,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:44,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:44,845 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2022-01-31 16:23:44,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:23:44,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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 75 [2022-01-31 16:23:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:44,846 INFO L225 Difference]: With dead ends: 273 [2022-01-31 16:23:44,846 INFO L226 Difference]: Without dead ends: 273 [2022-01-31 16:23:44,846 INFO L932 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-01-31 16:23:44,846 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 39 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:44,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 509 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-01-31 16:23:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-01-31 16:23:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 246. [2022-01-31 16:23:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5186721991701244) internal successors, (366), 241 states have internal predecessors, (366), 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-01-31 16:23:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 370 transitions. [2022-01-31 16:23:44,850 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 370 transitions. Word has length 75 [2022-01-31 16:23:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:44,850 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 370 transitions. [2022-01-31 16:23:44,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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-01-31 16:23:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 370 transitions. [2022-01-31 16:23:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-31 16:23:44,851 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:44,851 INFO L514 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] [2022-01-31 16:23:44,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 16:23:44,851 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:44,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:44,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2128965550, now seen corresponding path program 1 times [2022-01-31 16:23:44,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:44,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693121582] [2022-01-31 16:23:44,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:44,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:23:44,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:44,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693121582] [2022-01-31 16:23:44,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693121582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:44,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:44,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:23:44,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892969755] [2022-01-31 16:23:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:44,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:23:44,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:44,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:23:44,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:23:44,931 INFO L87 Difference]: Start difference. First operand 246 states and 370 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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-01-31 16:23:45,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:47,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:49,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:51,182 INFO L93 Difference]: Finished difference Result 355 states and 531 transitions. [2022-01-31 16:23:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:23:51,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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 77 [2022-01-31 16:23:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:51,184 INFO L225 Difference]: With dead ends: 355 [2022-01-31 16:23:51,184 INFO L226 Difference]: Without dead ends: 355 [2022-01-31 16:23:51,184 INFO L932 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-01-31 16:23:51,184 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 148 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:51,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 344 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-01-31 16:23:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-01-31 16:23:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 246. [2022-01-31 16:23:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5020746887966805) internal successors, (362), 241 states have internal predecessors, (362), 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-01-31 16:23:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 366 transitions. [2022-01-31 16:23:51,189 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 366 transitions. Word has length 77 [2022-01-31 16:23:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:51,189 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 366 transitions. [2022-01-31 16:23:51,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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-01-31 16:23:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 366 transitions. [2022-01-31 16:23:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-31 16:23:51,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:51,190 INFO L514 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] [2022-01-31 16:23:51,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 16:23:51,190 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1952802305, now seen corresponding path program 1 times [2022-01-31 16:23:51,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:51,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321130211] [2022-01-31 16:23:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:51,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:23:51,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:51,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321130211] [2022-01-31 16:23:51,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321130211] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:51,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:51,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:23:51,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723917256] [2022-01-31 16:23:51,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:51,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:23:51,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:51,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:23:51,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:23:51,283 INFO L87 Difference]: Start difference. First operand 246 states and 366 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-01-31 16:23:52,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:54,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:55,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:23:56,385 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2022-01-31 16:23:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:23:56,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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 78 [2022-01-31 16:23:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:23:56,386 INFO L225 Difference]: With dead ends: 355 [2022-01-31 16:23:56,386 INFO L226 Difference]: Without dead ends: 355 [2022-01-31 16:23:56,386 INFO L932 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-01-31 16:23:56,387 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 146 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:23:56,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 344 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-01-31 16:23:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-01-31 16:23:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 246. [2022-01-31 16:23:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.4854771784232366) internal successors, (358), 241 states have internal predecessors, (358), 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-01-31 16:23:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 362 transitions. [2022-01-31 16:23:56,391 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 362 transitions. Word has length 78 [2022-01-31 16:23:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:23:56,391 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 362 transitions. [2022-01-31 16:23:56,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-01-31 16:23:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 362 transitions. [2022-01-31 16:23:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-31 16:23:56,391 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:23:56,391 INFO L514 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] [2022-01-31 16:23:56,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 16:23:56,391 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:23:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:23:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2041710414, now seen corresponding path program 1 times [2022-01-31 16:23:56,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:23:56,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757056795] [2022-01-31 16:23:56,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:23:56,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:23:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:23:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:23:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:23:56,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:23:56,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757056795] [2022-01-31 16:23:56,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757056795] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:23:56,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:23:56,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:23:56,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623439399] [2022-01-31 16:23:56,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:23:56,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:23:56,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:23:56,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:23:56,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:23:56,475 INFO L87 Difference]: Start difference. First operand 246 states and 362 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-01-31 16:23:57,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:23:59,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:02,000 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-01-31 16:24:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:02,501 INFO L93 Difference]: Finished difference Result 353 states and 517 transitions. [2022-01-31 16:24:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:24:02,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-01-31 16:24:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:02,503 INFO L225 Difference]: With dead ends: 353 [2022-01-31 16:24:02,503 INFO L226 Difference]: Without dead ends: 353 [2022-01-31 16:24:02,503 INFO L932 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-01-31 16:24:02,503 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 90 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:02,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 513 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 526 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-01-31 16:24:02,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-01-31 16:24:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 277. [2022-01-31 16:24:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 272 states have (on average 1.4926470588235294) internal successors, (406), 272 states have internal predecessors, (406), 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-01-31 16:24:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 410 transitions. [2022-01-31 16:24:02,507 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 410 transitions. Word has length 82 [2022-01-31 16:24:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:02,508 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 410 transitions. [2022-01-31 16:24:02,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-01-31 16:24:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 410 transitions. [2022-01-31 16:24:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-31 16:24:02,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:02,508 INFO L514 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] [2022-01-31 16:24:02,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 16:24:02,508 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:02,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1016218415, now seen corresponding path program 1 times [2022-01-31 16:24:02,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:02,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522344279] [2022-01-31 16:24:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:02,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:24:02,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:02,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522344279] [2022-01-31 16:24:02,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522344279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:02,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:02,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:24:02,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339788661] [2022-01-31 16:24:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:02,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:24:02,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:24:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:24:02,661 INFO L87 Difference]: Start difference. First operand 277 states and 410 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-01-31 16:24:05,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:07,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:07,518 INFO L93 Difference]: Finished difference Result 335 states and 491 transitions. [2022-01-31 16:24:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:24:07,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-01-31 16:24:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:07,522 INFO L225 Difference]: With dead ends: 335 [2022-01-31 16:24:07,522 INFO L226 Difference]: Without dead ends: 335 [2022-01-31 16:24:07,523 INFO L932 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-01-31 16:24:07,523 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 37 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:07,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 605 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-01-31 16:24:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-01-31 16:24:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 301. [2022-01-31 16:24:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 296 states have internal predecessors, (443), 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-01-31 16:24:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 447 transitions. [2022-01-31 16:24:07,527 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 447 transitions. Word has length 82 [2022-01-31 16:24:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:07,527 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 447 transitions. [2022-01-31 16:24:07,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-01-31 16:24:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 447 transitions. [2022-01-31 16:24:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-31 16:24:07,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:07,528 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-01-31 16:24:07,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 16:24:07,528 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -358305085, now seen corresponding path program 1 times [2022-01-31 16:24:07,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:07,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985316171] [2022-01-31 16:24:07,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:07,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:24:07,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:07,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985316171] [2022-01-31 16:24:07,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985316171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:07,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:07,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:24:07,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867054600] [2022-01-31 16:24:07,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:07,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:24:07,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:07,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:24:07,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:24:07,617 INFO L87 Difference]: Start difference. First operand 301 states and 447 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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-01-31 16:24:09,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:11,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:13,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:14,389 INFO L93 Difference]: Finished difference Result 400 states and 594 transitions. [2022-01-31 16:24:14,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:24:14,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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-01-31 16:24:14,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:14,390 INFO L225 Difference]: With dead ends: 400 [2022-01-31 16:24:14,390 INFO L226 Difference]: Without dead ends: 400 [2022-01-31 16:24:14,390 INFO L932 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-01-31 16:24:14,391 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 149 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 62 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:14,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 346 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 471 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-01-31 16:24:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-01-31 16:24:14,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 301. [2022-01-31 16:24:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 296 states have (on average 1.4763513513513513) internal successors, (437), 296 states have internal predecessors, (437), 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-01-31 16:24:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 441 transitions. [2022-01-31 16:24:14,395 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 441 transitions. Word has length 87 [2022-01-31 16:24:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:14,395 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 441 transitions. [2022-01-31 16:24:14,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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-01-31 16:24:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 441 transitions. [2022-01-31 16:24:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-31 16:24:14,398 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:14,398 INFO L514 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] [2022-01-31 16:24:14,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 16:24:14,399 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:14,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash -627016711, now seen corresponding path program 1 times [2022-01-31 16:24:14,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:14,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140273880] [2022-01-31 16:24:14,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:14,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:14,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:24:14,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:14,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140273880] [2022-01-31 16:24:14,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140273880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:14,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:14,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:24:14,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444037493] [2022-01-31 16:24:14,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:14,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:24:14,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:14,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:24:14,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:24:14,496 INFO L87 Difference]: Start difference. First operand 301 states and 441 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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-01-31 16:24:15,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:17,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:19,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:20,292 INFO L93 Difference]: Finished difference Result 429 states and 638 transitions. [2022-01-31 16:24:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:24:20,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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-01-31 16:24:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:20,296 INFO L225 Difference]: With dead ends: 429 [2022-01-31 16:24:20,296 INFO L226 Difference]: Without dead ends: 429 [2022-01-31 16:24:20,296 INFO L932 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-01-31 16:24:20,297 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 120 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:20,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-01-31 16:24:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-01-31 16:24:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 351. [2022-01-31 16:24:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 346 states have (on average 1.5115606936416186) internal successors, (523), 346 states have internal predecessors, (523), 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-01-31 16:24:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 527 transitions. [2022-01-31 16:24:20,305 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 527 transitions. Word has length 87 [2022-01-31 16:24:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:20,305 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 527 transitions. [2022-01-31 16:24:20,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 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-01-31 16:24:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 527 transitions. [2022-01-31 16:24:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-31 16:24:20,306 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:20,306 INFO L514 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] [2022-01-31 16:24:20,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 16:24:20,306 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2038270526, now seen corresponding path program 1 times [2022-01-31 16:24:20,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:20,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140318668] [2022-01-31 16:24:20,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:20,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:24:20,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:20,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140318668] [2022-01-31 16:24:20,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140318668] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:20,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:20,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:24:20,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446669074] [2022-01-31 16:24:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:20,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:24:20,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:20,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:24:20,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:24:20,390 INFO L87 Difference]: Start difference. First operand 351 states and 527 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-01-31 16:24:22,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:24,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:24,736 INFO L93 Difference]: Finished difference Result 411 states and 613 transitions. [2022-01-31 16:24:24,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:24:24,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-01-31 16:24:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:24,738 INFO L225 Difference]: With dead ends: 411 [2022-01-31 16:24:24,738 INFO L226 Difference]: Without dead ends: 411 [2022-01-31 16:24:24,738 INFO L932 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-01-31 16:24:24,738 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 71 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:24,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 483 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-01-31 16:24:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-01-31 16:24:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 362. [2022-01-31 16:24:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.5210084033613445) internal successors, (543), 357 states have internal predecessors, (543), 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-01-31 16:24:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 547 transitions. [2022-01-31 16:24:24,742 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 547 transitions. Word has length 88 [2022-01-31 16:24:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:24,743 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 547 transitions. [2022-01-31 16:24:24,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-01-31 16:24:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 547 transitions. [2022-01-31 16:24:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-31 16:24:24,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:24,743 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-01-31 16:24:24,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 16:24:24,744 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash -987048744, now seen corresponding path program 1 times [2022-01-31 16:24:24,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:24,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927198613] [2022-01-31 16:24:24,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:24,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:24,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:24:24,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:24,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927198613] [2022-01-31 16:24:24,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927198613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:24,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:24,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:24:24,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245731875] [2022-01-31 16:24:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:24,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:24:24,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:24,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:24:24,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:24:24,842 INFO L87 Difference]: Start difference. First operand 362 states and 547 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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-01-31 16:24:26,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:28,959 INFO L93 Difference]: Finished difference Result 451 states and 675 transitions. [2022-01-31 16:24:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:24:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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 96 [2022-01-31 16:24:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:28,960 INFO L225 Difference]: With dead ends: 451 [2022-01-31 16:24:28,960 INFO L226 Difference]: Without dead ends: 451 [2022-01-31 16:24:28,960 INFO L932 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-01-31 16:24:28,961 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 142 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:28,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 348 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-01-31 16:24:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-01-31 16:24:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 362. [2022-01-31 16:24:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.5070028011204482) internal successors, (538), 357 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-01-31 16:24:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 542 transitions. [2022-01-31 16:24:28,965 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 542 transitions. Word has length 96 [2022-01-31 16:24:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:28,965 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 542 transitions. [2022-01-31 16:24:28,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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-01-31 16:24:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 542 transitions. [2022-01-31 16:24:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-31 16:24:28,966 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:28,966 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-01-31 16:24:28,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 16:24:28,966 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:28,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash 522570383, now seen corresponding path program 1 times [2022-01-31 16:24:28,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:28,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538338765] [2022-01-31 16:24:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:28,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:24:29,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:29,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538338765] [2022-01-31 16:24:29,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538338765] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:29,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:29,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:24:29,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457813439] [2022-01-31 16:24:29,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:29,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:24:29,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:29,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:24:29,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:24:29,054 INFO L87 Difference]: Start difference. First operand 362 states and 542 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-01-31 16:24:31,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:33,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:33,721 INFO L93 Difference]: Finished difference Result 441 states and 656 transitions. [2022-01-31 16:24:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:24:33,721 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 97 [2022-01-31 16:24:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:33,723 INFO L225 Difference]: With dead ends: 441 [2022-01-31 16:24:33,723 INFO L226 Difference]: Without dead ends: 441 [2022-01-31 16:24:33,723 INFO L932 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-01-31 16:24:33,723 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 139 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:33,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 368 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-01-31 16:24:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-01-31 16:24:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 362. [2022-01-31 16:24:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 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-01-31 16:24:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 536 transitions. [2022-01-31 16:24:33,728 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 536 transitions. Word has length 97 [2022-01-31 16:24:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:33,728 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 536 transitions. [2022-01-31 16:24:33,728 INFO L471 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-01-31 16:24:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 536 transitions. [2022-01-31 16:24:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 16:24:33,728 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:33,729 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-01-31 16:24:33,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 16:24:33,729 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash 39070128, now seen corresponding path program 1 times [2022-01-31 16:24:33,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:33,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313433192] [2022-01-31 16:24:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:33,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 16:24:33,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:33,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313433192] [2022-01-31 16:24:33,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313433192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:33,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:33,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:24:33,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922639675] [2022-01-31 16:24:33,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:33,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:24:33,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:24:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:24:33,813 INFO L87 Difference]: Start difference. First operand 362 states and 536 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-01-31 16:24:36,114 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-01-31 16:24:37,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:38,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:39,131 INFO L93 Difference]: Finished difference Result 399 states and 586 transitions. [2022-01-31 16:24:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:24:39,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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 104 [2022-01-31 16:24:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:39,133 INFO L225 Difference]: With dead ends: 399 [2022-01-31 16:24:39,133 INFO L226 Difference]: Without dead ends: 399 [2022-01-31 16:24:39,133 INFO L932 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-01-31 16:24:39,133 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 77 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:39,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 515 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 486 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-01-31 16:24:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-01-31 16:24:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 362. [2022-01-31 16:24:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.4873949579831933) internal successors, (531), 357 states have internal predecessors, (531), 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-01-31 16:24:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 535 transitions. [2022-01-31 16:24:39,137 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 535 transitions. Word has length 104 [2022-01-31 16:24:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:39,137 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 535 transitions. [2022-01-31 16:24:39,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-01-31 16:24:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 535 transitions. [2022-01-31 16:24:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 16:24:39,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:39,138 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-01-31 16:24:39,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 16:24:39,138 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:39,139 INFO L85 PathProgramCache]: Analyzing trace with hash 59407503, now seen corresponding path program 1 times [2022-01-31 16:24:39,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:39,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064506811] [2022-01-31 16:24:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:39,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:39,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-31 16:24:39,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:39,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064506811] [2022-01-31 16:24:39,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064506811] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:39,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:39,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:24:39,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853689849] [2022-01-31 16:24:39,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:39,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:24:39,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:39,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:24:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:24:39,240 INFO L87 Difference]: Start difference. First operand 362 states and 535 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 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-01-31 16:24:40,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:41,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:43,413 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-01-31 16:24:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:43,714 INFO L93 Difference]: Finished difference Result 693 states and 1026 transitions. [2022-01-31 16:24:43,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:24:43,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 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 104 [2022-01-31 16:24:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:43,716 INFO L225 Difference]: With dead ends: 693 [2022-01-31 16:24:43,717 INFO L226 Difference]: Without dead ends: 693 [2022-01-31 16:24:43,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:24:43,717 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 143 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:43,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 435 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 283 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-01-31 16:24:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-01-31 16:24:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2022-01-31 16:24:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 688 states have (on average 1.4854651162790697) internal successors, (1022), 688 states have internal predecessors, (1022), 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-01-31 16:24:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1026 transitions. [2022-01-31 16:24:43,725 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1026 transitions. Word has length 104 [2022-01-31 16:24:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:43,725 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 1026 transitions. [2022-01-31 16:24:43,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 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-01-31 16:24:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1026 transitions. [2022-01-31 16:24:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 16:24:43,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:43,726 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-01-31 16:24:43,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 16:24:43,726 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1871211602, now seen corresponding path program 1 times [2022-01-31 16:24:43,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:43,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104527447] [2022-01-31 16:24:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:43,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:43,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-31 16:24:43,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:43,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104527447] [2022-01-31 16:24:43,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104527447] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:43,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:43,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:24:43,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512940609] [2022-01-31 16:24:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:43,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:24:43,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:24:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:24:43,796 INFO L87 Difference]: Start difference. First operand 693 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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-01-31 16:24:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:45,943 INFO L93 Difference]: Finished difference Result 720 states and 1061 transitions. [2022-01-31 16:24:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:24:45,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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 104 [2022-01-31 16:24:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:45,946 INFO L225 Difference]: With dead ends: 720 [2022-01-31 16:24:45,946 INFO L226 Difference]: Without dead ends: 720 [2022-01-31 16:24:45,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:24:45,946 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:45,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 16:24:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-01-31 16:24:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2022-01-31 16:24:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 715 states have (on average 1.4783216783216784) internal successors, (1057), 715 states have internal predecessors, (1057), 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-01-31 16:24:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1061 transitions. [2022-01-31 16:24:45,956 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1061 transitions. Word has length 104 [2022-01-31 16:24:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:45,956 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1061 transitions. [2022-01-31 16:24:45,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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-01-31 16:24:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1061 transitions. [2022-01-31 16:24:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 16:24:45,957 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:45,957 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-01-31 16:24:45,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 16:24:45,957 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1451694771, now seen corresponding path program 1 times [2022-01-31 16:24:45,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:45,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112557832] [2022-01-31 16:24:45,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:45,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-01-31 16:24:46,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:46,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112557832] [2022-01-31 16:24:46,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112557832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:46,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:46,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:24:46,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776988543] [2022-01-31 16:24:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:46,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:24:46,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:46,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:24:46,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:24:46,030 INFO L87 Difference]: Start difference. First operand 720 states and 1061 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 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-01-31 16:24:47,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:49,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:51,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:52,108 INFO L93 Difference]: Finished difference Result 722 states and 1063 transitions. [2022-01-31 16:24:52,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:24:52,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 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 104 [2022-01-31 16:24:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:52,110 INFO L225 Difference]: With dead ends: 722 [2022-01-31 16:24:52,110 INFO L226 Difference]: Without dead ends: 722 [2022-01-31 16:24:52,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:24:52,111 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:52,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-01-31 16:24:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-01-31 16:24:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2022-01-31 16:24:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 717 states have (on average 1.4769874476987448) internal successors, (1059), 717 states have internal predecessors, (1059), 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-01-31 16:24:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1063 transitions. [2022-01-31 16:24:52,117 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1063 transitions. Word has length 104 [2022-01-31 16:24:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:52,117 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 1063 transitions. [2022-01-31 16:24:52,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 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-01-31 16:24:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1063 transitions. [2022-01-31 16:24:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-31 16:24:52,118 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:52,118 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 16:24:52,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 16:24:52,119 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:52,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2030270456, now seen corresponding path program 1 times [2022-01-31 16:24:52,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:52,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931388310] [2022-01-31 16:24:52,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:52,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:24:52,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:52,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931388310] [2022-01-31 16:24:52,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931388310] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:52,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:52,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:24:52,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609993003] [2022-01-31 16:24:52,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:52,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:24:52,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:52,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:24:52,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:24:52,207 INFO L87 Difference]: Start difference. First operand 722 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:24:53,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:55,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:57,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:24:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:24:57,631 INFO L93 Difference]: Finished difference Result 1058 states and 1566 transitions. [2022-01-31 16:24:57,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:24:57,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-01-31 16:24:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:24:57,634 INFO L225 Difference]: With dead ends: 1058 [2022-01-31 16:24:57,634 INFO L226 Difference]: Without dead ends: 1058 [2022-01-31 16:24:57,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:24:57,634 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 164 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:24:57,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 379 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-01-31 16:24:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-01-31 16:24:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2022-01-31 16:24:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1051 states have (on average 1.4852521408182684) internal successors, (1561), 1051 states have internal predecessors, (1561), 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-01-31 16:24:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1565 transitions. [2022-01-31 16:24:57,644 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1565 transitions. Word has length 106 [2022-01-31 16:24:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:24:57,645 INFO L470 AbstractCegarLoop]: Abstraction has 1056 states and 1565 transitions. [2022-01-31 16:24:57,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:24:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1565 transitions. [2022-01-31 16:24:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-31 16:24:57,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:24:57,646 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-01-31 16:24:57,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 16:24:57,646 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:24:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:24:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash 538755348, now seen corresponding path program 1 times [2022-01-31 16:24:57,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:24:57,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797250046] [2022-01-31 16:24:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:24:57,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:24:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:24:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:24:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:24:57,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:24:57,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797250046] [2022-01-31 16:24:57,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797250046] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:24:57,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:24:57,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:24:57,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393372452] [2022-01-31 16:24:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:24:57,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:24:57,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:24:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:24:57,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:24:57,728 INFO L87 Difference]: Start difference. First operand 1056 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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-01-31 16:25:00,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:00,477 INFO L93 Difference]: Finished difference Result 1392 states and 2054 transitions. [2022-01-31 16:25:00,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:25:00,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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 112 [2022-01-31 16:25:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:00,480 INFO L225 Difference]: With dead ends: 1392 [2022-01-31 16:25:00,481 INFO L226 Difference]: Without dead ends: 1392 [2022-01-31 16:25:00,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:25:00,481 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 149 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:00,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 576 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-01-31 16:25:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-01-31 16:25:00,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1390. [2022-01-31 16:25:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1385 states have (on average 1.47942238267148) internal successors, (2049), 1385 states have internal predecessors, (2049), 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-01-31 16:25:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2053 transitions. [2022-01-31 16:25:00,521 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2053 transitions. Word has length 112 [2022-01-31 16:25:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:00,521 INFO L470 AbstractCegarLoop]: Abstraction has 1390 states and 2053 transitions. [2022-01-31 16:25:00,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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-01-31 16:25:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2053 transitions. [2022-01-31 16:25:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-31 16:25:00,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:00,523 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 16:25:00,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 16:25:00,523 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:00,524 INFO L85 PathProgramCache]: Analyzing trace with hash 566693233, now seen corresponding path program 1 times [2022-01-31 16:25:00,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:00,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549753491] [2022-01-31 16:25:00,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:00,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:00,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:00,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:00,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549753491] [2022-01-31 16:25:00,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549753491] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:00,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:00,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:00,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220573995] [2022-01-31 16:25:00,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:00,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:00,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:00,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:00,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:00,614 INFO L87 Difference]: Start difference. First operand 1390 states and 2053 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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-01-31 16:25:01,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:03,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:06,597 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-01-31 16:25:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:07,023 INFO L93 Difference]: Finished difference Result 1648 states and 2429 transitions. [2022-01-31 16:25:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 129 [2022-01-31 16:25:07,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:07,027 INFO L225 Difference]: With dead ends: 1648 [2022-01-31 16:25:07,027 INFO L226 Difference]: Without dead ends: 1648 [2022-01-31 16:25:07,027 INFO L932 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-01-31 16:25:07,027 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 72 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:07,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 654 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-01-31 16:25:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-01-31 16:25:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1477. [2022-01-31 16:25:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1472 states have (on average 1.481657608695652) internal successors, (2181), 1472 states have internal predecessors, (2181), 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-01-31 16:25:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2185 transitions. [2022-01-31 16:25:07,040 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2185 transitions. Word has length 129 [2022-01-31 16:25:07,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:07,040 INFO L470 AbstractCegarLoop]: Abstraction has 1477 states and 2185 transitions. [2022-01-31 16:25:07,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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-01-31 16:25:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2185 transitions. [2022-01-31 16:25:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-31 16:25:07,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:07,042 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-01-31 16:25:07,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 16:25:07,042 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:07,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash -224082698, now seen corresponding path program 1 times [2022-01-31 16:25:07,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:07,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307491385] [2022-01-31 16:25:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:07,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-01-31 16:25:07,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:07,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307491385] [2022-01-31 16:25:07,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307491385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:07,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:07,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:25:07,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728223601] [2022-01-31 16:25:07,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:07,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:25:07,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:07,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:25:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:25:07,125 INFO L87 Difference]: Start difference. First operand 1477 states and 2185 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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-01-31 16:25:08,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:09,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:10,283 INFO L93 Difference]: Finished difference Result 1842 states and 2726 transitions. [2022-01-31 16:25:10,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:25:10,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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 134 [2022-01-31 16:25:10,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:10,288 INFO L225 Difference]: With dead ends: 1842 [2022-01-31 16:25:10,288 INFO L226 Difference]: Without dead ends: 1842 [2022-01-31 16:25:10,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:25:10,289 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:10,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-01-31 16:25:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2022-01-31 16:25:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1840. [2022-01-31 16:25:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1835 states have (on average 1.48283378746594) internal successors, (2721), 1835 states have internal predecessors, (2721), 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-01-31 16:25:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2725 transitions. [2022-01-31 16:25:10,305 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2725 transitions. Word has length 134 [2022-01-31 16:25:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:10,305 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2725 transitions. [2022-01-31 16:25:10,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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-01-31 16:25:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2725 transitions. [2022-01-31 16:25:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-01-31 16:25:10,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:10,307 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1] [2022-01-31 16:25:10,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 16:25:10,307 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2056958033, now seen corresponding path program 1 times [2022-01-31 16:25:10,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:10,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551624033] [2022-01-31 16:25:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:10,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:10,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:10,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:10,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551624033] [2022-01-31 16:25:10,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551624033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:10,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:10,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:10,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035750803] [2022-01-31 16:25:10,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:10,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:10,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:10,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:10,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:10,387 INFO L87 Difference]: Start difference. First operand 1840 states and 2725 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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-01-31 16:25:11,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:13,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:14,164 INFO L93 Difference]: Finished difference Result 2067 states and 3044 transitions. [2022-01-31 16:25:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:14,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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 151 [2022-01-31 16:25:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:14,168 INFO L225 Difference]: With dead ends: 2067 [2022-01-31 16:25:14,169 INFO L226 Difference]: Without dead ends: 2067 [2022-01-31 16:25:14,169 INFO L932 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-01-31 16:25:14,169 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 87 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:14,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 652 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-01-31 16:25:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-01-31 16:25:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1840. [2022-01-31 16:25:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1835 states have (on average 1.4806539509536785) internal successors, (2717), 1835 states have internal predecessors, (2717), 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-01-31 16:25:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2721 transitions. [2022-01-31 16:25:14,189 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2721 transitions. Word has length 151 [2022-01-31 16:25:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:14,190 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2721 transitions. [2022-01-31 16:25:14,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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-01-31 16:25:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2721 transitions. [2022-01-31 16:25:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-31 16:25:14,192 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:14,192 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1] [2022-01-31 16:25:14,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 16:25:14,192 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:14,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:14,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2049187141, now seen corresponding path program 1 times [2022-01-31 16:25:14,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:14,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359989182] [2022-01-31 16:25:14,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:14,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:14,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:14,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359989182] [2022-01-31 16:25:14,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359989182] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:14,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:14,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:14,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76597622] [2022-01-31 16:25:14,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:14,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:14,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:14,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:14,296 INFO L87 Difference]: Start difference. First operand 1840 states and 2721 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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-01-31 16:25:18,563 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-01-31 16:25:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:18,991 INFO L93 Difference]: Finished difference Result 2047 states and 3015 transitions. [2022-01-31 16:25:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:18,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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 152 [2022-01-31 16:25:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:18,996 INFO L225 Difference]: With dead ends: 2047 [2022-01-31 16:25:18,996 INFO L226 Difference]: Without dead ends: 2047 [2022-01-31 16:25:18,996 INFO L932 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-01-31 16:25:18,996 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 79 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:18,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 640 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 581 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-01-31 16:25:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2022-01-31 16:25:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1840. [2022-01-31 16:25:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1835 states have (on average 1.4784741144414169) internal successors, (2713), 1835 states have internal predecessors, (2713), 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-01-31 16:25:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2717 transitions. [2022-01-31 16:25:19,011 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2717 transitions. Word has length 152 [2022-01-31 16:25:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:19,012 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2717 transitions. [2022-01-31 16:25:19,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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-01-31 16:25:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2717 transitions. [2022-01-31 16:25:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-31 16:25:19,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:19,014 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:25:19,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 16:25:19,014 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:19,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1005470395, now seen corresponding path program 1 times [2022-01-31 16:25:19,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:19,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764301900] [2022-01-31 16:25:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:19,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:19,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:19,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764301900] [2022-01-31 16:25:19,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764301900] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:19,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:19,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:19,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305591980] [2022-01-31 16:25:19,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:19,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:19,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:19,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:19,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:19,107 INFO L87 Difference]: Start difference. First operand 1840 states and 2717 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 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-01-31 16:25:20,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:22,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:24,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:25,047 INFO L93 Difference]: Finished difference Result 2015 states and 2959 transitions. [2022-01-31 16:25:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:25,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 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 155 [2022-01-31 16:25:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:25,052 INFO L225 Difference]: With dead ends: 2015 [2022-01-31 16:25:25,052 INFO L226 Difference]: Without dead ends: 2015 [2022-01-31 16:25:25,053 INFO L932 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-01-31 16:25:25,053 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 65 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:25,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 630 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 544 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2022-01-31 16:25:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2022-01-31 16:25:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1824. [2022-01-31 16:25:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1819 states have (on average 1.4760857614073666) internal successors, (2685), 1819 states have internal predecessors, (2685), 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-01-31 16:25:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2689 transitions. [2022-01-31 16:25:25,108 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2689 transitions. Word has length 155 [2022-01-31 16:25:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:25,108 INFO L470 AbstractCegarLoop]: Abstraction has 1824 states and 2689 transitions. [2022-01-31 16:25:25,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 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-01-31 16:25:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2689 transitions. [2022-01-31 16:25:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-31 16:25:25,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:25,111 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-01-31 16:25:25,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 16:25:25,111 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1789143693, now seen corresponding path program 1 times [2022-01-31 16:25:25,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:25,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974854475] [2022-01-31 16:25:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:25,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:25,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:25,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:25,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974854475] [2022-01-31 16:25:25,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974854475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:25,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:25,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:25,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372019691] [2022-01-31 16:25:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:25,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:25,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:25,201 INFO L87 Difference]: Start difference. First operand 1824 states and 2689 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 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-01-31 16:25:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:27,701 INFO L93 Difference]: Finished difference Result 2015 states and 2955 transitions. [2022-01-31 16:25:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:27,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 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 156 [2022-01-31 16:25:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:27,706 INFO L225 Difference]: With dead ends: 2015 [2022-01-31 16:25:27,706 INFO L226 Difference]: Without dead ends: 2015 [2022-01-31 16:25:27,706 INFO L932 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-01-31 16:25:27,707 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 63 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:27,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 628 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 16:25:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2022-01-31 16:25:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1844. [2022-01-31 16:25:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1839 states have (on average 1.475258292550299) internal successors, (2713), 1839 states have internal predecessors, (2713), 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-01-31 16:25:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2717 transitions. [2022-01-31 16:25:27,723 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2717 transitions. Word has length 156 [2022-01-31 16:25:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:27,723 INFO L470 AbstractCegarLoop]: Abstraction has 1844 states and 2717 transitions. [2022-01-31 16:25:27,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 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-01-31 16:25:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2717 transitions. [2022-01-31 16:25:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-31 16:25:27,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:27,725 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:25:27,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 16:25:27,726 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash -116849752, now seen corresponding path program 1 times [2022-01-31 16:25:27,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:27,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381871273] [2022-01-31 16:25:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:27,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:27,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:27,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381871273] [2022-01-31 16:25:27,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381871273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:27,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:27,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:27,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475565230] [2022-01-31 16:25:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:27,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:27,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:27,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:27,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:27,811 INFO L87 Difference]: Start difference. First operand 1844 states and 2717 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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-01-31 16:25:30,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-01-31 16:25:32,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:33,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:33,893 INFO L93 Difference]: Finished difference Result 2015 states and 2951 transitions. [2022-01-31 16:25:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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 157 [2022-01-31 16:25:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:33,898 INFO L225 Difference]: With dead ends: 2015 [2022-01-31 16:25:33,898 INFO L226 Difference]: Without dead ends: 2015 [2022-01-31 16:25:33,898 INFO L932 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-01-31 16:25:33,899 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 66 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:33,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 626 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 542 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-01-31 16:25:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2022-01-31 16:25:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1844. [2022-01-31 16:25:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1839 states have (on average 1.473083197389886) internal successors, (2709), 1839 states have internal predecessors, (2709), 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-01-31 16:25:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2713 transitions. [2022-01-31 16:25:33,915 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2713 transitions. Word has length 157 [2022-01-31 16:25:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:33,915 INFO L470 AbstractCegarLoop]: Abstraction has 1844 states and 2713 transitions. [2022-01-31 16:25:33,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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-01-31 16:25:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2713 transitions. [2022-01-31 16:25:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-31 16:25:33,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:33,917 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 16:25:33,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 16:25:33,917 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1499023576, now seen corresponding path program 1 times [2022-01-31 16:25:33,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:33,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80206336] [2022-01-31 16:25:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:33,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:34,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:34,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:34,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80206336] [2022-01-31 16:25:34,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80206336] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:34,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:34,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:34,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237678129] [2022-01-31 16:25:34,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:34,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:34,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:34,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:34,005 INFO L87 Difference]: Start difference. First operand 1844 states and 2713 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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-01-31 16:25:35,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:36,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:38,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:39,290 INFO L93 Difference]: Finished difference Result 2231 states and 3262 transitions. [2022-01-31 16:25:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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 157 [2022-01-31 16:25:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:39,295 INFO L225 Difference]: With dead ends: 2231 [2022-01-31 16:25:39,295 INFO L226 Difference]: Without dead ends: 2231 [2022-01-31 16:25:39,295 INFO L932 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-01-31 16:25:39,295 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 118 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:39,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 372 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-01-31 16:25:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-01-31 16:25:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1859. [2022-01-31 16:25:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1854 states have (on average 1.4692556634304208) internal successors, (2724), 1854 states have internal predecessors, (2724), 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-01-31 16:25:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2728 transitions. [2022-01-31 16:25:39,313 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2728 transitions. Word has length 157 [2022-01-31 16:25:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:39,313 INFO L470 AbstractCegarLoop]: Abstraction has 1859 states and 2728 transitions. [2022-01-31 16:25:39,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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-01-31 16:25:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2728 transitions. [2022-01-31 16:25:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-31 16:25:39,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:39,315 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-01-31 16:25:39,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 16:25:39,315 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:39,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1141285446, now seen corresponding path program 1 times [2022-01-31 16:25:39,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:39,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196355800] [2022-01-31 16:25:39,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:39,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:39,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:39,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196355800] [2022-01-31 16:25:39,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196355800] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:39,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:39,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:39,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542811509] [2022-01-31 16:25:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:39,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:39,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:39,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:39,419 INFO L87 Difference]: Start difference. First operand 1859 states and 2728 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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-01-31 16:25:41,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:43,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:45,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:47,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:47,861 INFO L93 Difference]: Finished difference Result 2010 states and 2934 transitions. [2022-01-31 16:25:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:47,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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 157 [2022-01-31 16:25:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:47,865 INFO L225 Difference]: With dead ends: 2010 [2022-01-31 16:25:47,865 INFO L226 Difference]: Without dead ends: 2010 [2022-01-31 16:25:47,865 INFO L932 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-01-31 16:25:47,866 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 56 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:47,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 618 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 523 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-01-31 16:25:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2022-01-31 16:25:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1867. [2022-01-31 16:25:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1862 states have (on average 1.4672395273899033) internal successors, (2732), 1862 states have internal predecessors, (2732), 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-01-31 16:25:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2736 transitions. [2022-01-31 16:25:47,882 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2736 transitions. Word has length 157 [2022-01-31 16:25:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:47,882 INFO L470 AbstractCegarLoop]: Abstraction has 1867 states and 2736 transitions. [2022-01-31 16:25:47,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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-01-31 16:25:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2736 transitions. [2022-01-31 16:25:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-31 16:25:47,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:47,884 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:25:47,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 16:25:47,885 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:47,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash -890117485, now seen corresponding path program 1 times [2022-01-31 16:25:47,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:47,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281966687] [2022-01-31 16:25:47,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:47,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:47,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:47,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281966687] [2022-01-31 16:25:47,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281966687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:47,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:47,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:47,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321850909] [2022-01-31 16:25:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:47,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:47,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:47,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:47,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:47,996 INFO L87 Difference]: Start difference. First operand 1867 states and 2736 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 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-01-31 16:25:49,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:51,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:53,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:54,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:25:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:55,005 INFO L93 Difference]: Finished difference Result 2002 states and 2918 transitions. [2022-01-31 16:25:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:55,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 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 158 [2022-01-31 16:25:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:55,009 INFO L225 Difference]: With dead ends: 2002 [2022-01-31 16:25:55,009 INFO L226 Difference]: Without dead ends: 2002 [2022-01-31 16:25:55,009 INFO L932 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-01-31 16:25:55,009 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 59 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:55,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 616 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 513 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-01-31 16:25:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2022-01-31 16:25:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1867. [2022-01-31 16:25:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1862 states have (on average 1.4650912996777659) internal successors, (2728), 1862 states have internal predecessors, (2728), 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-01-31 16:25:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2732 transitions. [2022-01-31 16:25:55,025 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2732 transitions. Word has length 158 [2022-01-31 16:25:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:55,025 INFO L470 AbstractCegarLoop]: Abstraction has 1867 states and 2732 transitions. [2022-01-31 16:25:55,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 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-01-31 16:25:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2732 transitions. [2022-01-31 16:25:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-31 16:25:55,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:55,040 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-01-31 16:25:55,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 16:25:55,040 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:55,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1644898489, now seen corresponding path program 1 times [2022-01-31 16:25:55,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:55,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756400365] [2022-01-31 16:25:55,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:55,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:55,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:55,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756400365] [2022-01-31 16:25:55,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756400365] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:55,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:55,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:55,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711355294] [2022-01-31 16:25:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:55,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:55,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:55,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:55,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:55,130 INFO L87 Difference]: Start difference. First operand 1867 states and 2732 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 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-01-31 16:25:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:25:57,554 INFO L93 Difference]: Finished difference Result 2002 states and 2914 transitions. [2022-01-31 16:25:57,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:25:57,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 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 160 [2022-01-31 16:25:57,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:25:57,557 INFO L225 Difference]: With dead ends: 2002 [2022-01-31 16:25:57,557 INFO L226 Difference]: Without dead ends: 2002 [2022-01-31 16:25:57,557 INFO L932 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-01-31 16:25:57,558 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 52 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:25:57,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 614 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:25:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2022-01-31 16:25:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1871. [2022-01-31 16:25:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1866 states have (on average 1.4640943193997857) internal successors, (2732), 1866 states have internal predecessors, (2732), 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-01-31 16:25:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2736 transitions. [2022-01-31 16:25:57,573 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2736 transitions. Word has length 160 [2022-01-31 16:25:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:25:57,573 INFO L470 AbstractCegarLoop]: Abstraction has 1871 states and 2736 transitions. [2022-01-31 16:25:57,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 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-01-31 16:25:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2736 transitions. [2022-01-31 16:25:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 16:25:57,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:25:57,575 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-01-31 16:25:57,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 16:25:57,575 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:25:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:25:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash -231774159, now seen corresponding path program 1 times [2022-01-31 16:25:57,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:25:57,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633805899] [2022-01-31 16:25:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:25:57,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:25:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:57,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:25:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:25:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:25:57,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:25:57,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633805899] [2022-01-31 16:25:57,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633805899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:25:57,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:25:57,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:25:57,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744092931] [2022-01-31 16:25:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:25:57,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:25:57,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:25:57,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:25:57,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:25:57,665 INFO L87 Difference]: Start difference. First operand 1871 states and 2736 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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-01-31 16:25:59,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:01,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:03,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:04,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:05,388 INFO L93 Difference]: Finished difference Result 2243 states and 3255 transitions. [2022-01-31 16:26:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:26:05,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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 161 [2022-01-31 16:26:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:05,391 INFO L225 Difference]: With dead ends: 2243 [2022-01-31 16:26:05,391 INFO L226 Difference]: Without dead ends: 2243 [2022-01-31 16:26:05,391 INFO L932 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-01-31 16:26:05,391 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 114 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 56 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:05,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 368 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 461 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-01-31 16:26:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2022-01-31 16:26:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1886. [2022-01-31 16:26:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1881 states have (on average 1.4603934077618288) internal successors, (2747), 1881 states have internal predecessors, (2747), 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-01-31 16:26:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2751 transitions. [2022-01-31 16:26:05,406 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2751 transitions. Word has length 161 [2022-01-31 16:26:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:05,406 INFO L470 AbstractCegarLoop]: Abstraction has 1886 states and 2751 transitions. [2022-01-31 16:26:05,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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-01-31 16:26:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2751 transitions. [2022-01-31 16:26:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 16:26:05,408 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:05,408 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:26:05,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 16:26:05,408 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash -242797578, now seen corresponding path program 1 times [2022-01-31 16:26:05,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:05,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527938622] [2022-01-31 16:26:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:05,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:05,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:26:05,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:05,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527938622] [2022-01-31 16:26:05,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527938622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:05,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:05,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:26:05,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114977089] [2022-01-31 16:26:05,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:05,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:26:05,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:05,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:26:05,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:26:05,498 INFO L87 Difference]: Start difference. First operand 1886 states and 2751 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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-01-31 16:26:08,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:10,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:11,333 INFO L93 Difference]: Finished difference Result 2001 states and 2901 transitions. [2022-01-31 16:26:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:26:11,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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 161 [2022-01-31 16:26:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:11,336 INFO L225 Difference]: With dead ends: 2001 [2022-01-31 16:26:11,336 INFO L226 Difference]: Without dead ends: 2001 [2022-01-31 16:26:11,336 INFO L932 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-01-31 16:26:11,337 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 45 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:11,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 604 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 499 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-01-31 16:26:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2022-01-31 16:26:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1894. [2022-01-31 16:26:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1889 states have (on average 1.4584436209634728) internal successors, (2755), 1889 states have internal predecessors, (2755), 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-01-31 16:26:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2759 transitions. [2022-01-31 16:26:11,351 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2759 transitions. Word has length 161 [2022-01-31 16:26:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:11,351 INFO L470 AbstractCegarLoop]: Abstraction has 1894 states and 2759 transitions. [2022-01-31 16:26:11,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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-01-31 16:26:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2759 transitions. [2022-01-31 16:26:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-31 16:26:11,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:11,353 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-01-31 16:26:11,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 16:26:11,353 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:11,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1789542991, now seen corresponding path program 1 times [2022-01-31 16:26:11,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:11,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523548125] [2022-01-31 16:26:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:11,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:11,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:26:11,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:11,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523548125] [2022-01-31 16:26:11,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523548125] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:11,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:11,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:26:11,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759130461] [2022-01-31 16:26:11,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:11,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:26:11,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:11,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:26:11,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:26:11,456 INFO L87 Difference]: Start difference. First operand 1894 states and 2759 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:26:14,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:15,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:17,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:18,091 INFO L93 Difference]: Finished difference Result 1993 states and 2889 transitions. [2022-01-31 16:26:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:26:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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 162 [2022-01-31 16:26:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:18,093 INFO L225 Difference]: With dead ends: 1993 [2022-01-31 16:26:18,093 INFO L226 Difference]: Without dead ends: 1993 [2022-01-31 16:26:18,094 INFO L932 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-01-31 16:26:18,094 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 42 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:18,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 600 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 492 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-01-31 16:26:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-01-31 16:26:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1898. [2022-01-31 16:26:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1893 states have (on average 1.4574749075541469) internal successors, (2759), 1893 states have internal predecessors, (2759), 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-01-31 16:26:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2763 transitions. [2022-01-31 16:26:18,108 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2763 transitions. Word has length 162 [2022-01-31 16:26:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:18,108 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 2763 transitions. [2022-01-31 16:26:18,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:26:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2763 transitions. [2022-01-31 16:26:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-31 16:26:18,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:18,110 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 16:26:18,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 16:26:18,111 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash 268806909, now seen corresponding path program 1 times [2022-01-31 16:26:18,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:18,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090378689] [2022-01-31 16:26:18,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:18,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:18,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:26:18,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:18,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090378689] [2022-01-31 16:26:18,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090378689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:18,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:18,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:26:18,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954502081] [2022-01-31 16:26:18,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:18,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:26:18,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:18,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:26:18,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:26:18,216 INFO L87 Difference]: Start difference. First operand 1898 states and 2763 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:26:20,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:22,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:24,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:24,602 INFO L93 Difference]: Finished difference Result 1993 states and 2885 transitions. [2022-01-31 16:26:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:26:24,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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 162 [2022-01-31 16:26:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:24,605 INFO L225 Difference]: With dead ends: 1993 [2022-01-31 16:26:24,605 INFO L226 Difference]: Without dead ends: 1993 [2022-01-31 16:26:24,605 INFO L932 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-01-31 16:26:24,606 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 40 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:24,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 598 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-01-31 16:26:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-01-31 16:26:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1902. [2022-01-31 16:26:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1897 states have (on average 1.456510279388508) internal successors, (2763), 1897 states have internal predecessors, (2763), 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-01-31 16:26:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2767 transitions. [2022-01-31 16:26:24,620 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2767 transitions. Word has length 162 [2022-01-31 16:26:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:24,620 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 2767 transitions. [2022-01-31 16:26:24,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:26:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2767 transitions. [2022-01-31 16:26:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-31 16:26:24,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:24,622 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 16:26:24,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 16:26:24,622 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash 207567975, now seen corresponding path program 1 times [2022-01-31 16:26:24,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:24,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664125700] [2022-01-31 16:26:24,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:24,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:24,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:26:24,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:24,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664125700] [2022-01-31 16:26:24,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664125700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:24,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:24,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:26:24,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903161842] [2022-01-31 16:26:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:24,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:26:24,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:24,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:26:24,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:26:24,738 INFO L87 Difference]: Start difference. First operand 1902 states and 2767 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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-01-31 16:26:25,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:27,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:29,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:31,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:31,563 INFO L93 Difference]: Finished difference Result 2259 states and 3256 transitions. [2022-01-31 16:26:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:26:31,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 163 [2022-01-31 16:26:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:31,569 INFO L225 Difference]: With dead ends: 2259 [2022-01-31 16:26:31,570 INFO L226 Difference]: Without dead ends: 2259 [2022-01-31 16:26:31,570 INFO L932 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-01-31 16:26:31,577 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 109 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 56 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:31,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 368 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 461 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-01-31 16:26:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2022-01-31 16:26:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1922. [2022-01-31 16:26:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1917 states have (on average 1.4543557642149192) internal successors, (2788), 1917 states have internal predecessors, (2788), 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-01-31 16:26:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2792 transitions. [2022-01-31 16:26:31,595 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2792 transitions. Word has length 163 [2022-01-31 16:26:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:31,595 INFO L470 AbstractCegarLoop]: Abstraction has 1922 states and 2792 transitions. [2022-01-31 16:26:31,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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-01-31 16:26:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2792 transitions. [2022-01-31 16:26:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-31 16:26:31,597 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:31,597 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-01-31 16:26:31,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 16:26:31,598 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:31,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1467222768, now seen corresponding path program 1 times [2022-01-31 16:26:31,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:31,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572284447] [2022-01-31 16:26:31,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:31,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:31,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-01-31 16:26:31,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:31,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572284447] [2022-01-31 16:26:31,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572284447] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:31,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:31,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:26:31,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135503071] [2022-01-31 16:26:31,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:31,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:26:31,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:31,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:26:31,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:26:31,697 INFO L87 Difference]: Start difference. First operand 1922 states and 2792 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 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-01-31 16:26:33,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:34,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:36,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:37,358 INFO L93 Difference]: Finished difference Result 2302 states and 3343 transitions. [2022-01-31 16:26:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:26:37,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 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 171 [2022-01-31 16:26:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:37,361 INFO L225 Difference]: With dead ends: 2302 [2022-01-31 16:26:37,361 INFO L226 Difference]: Without dead ends: 2302 [2022-01-31 16:26:37,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:26:37,362 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 145 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:37,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 581 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 428 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-01-31 16:26:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2022-01-31 16:26:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2302. [2022-01-31 16:26:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2297 states have (on average 1.453635176316935) internal successors, (3339), 2297 states have internal predecessors, (3339), 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-01-31 16:26:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3343 transitions. [2022-01-31 16:26:37,378 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3343 transitions. Word has length 171 [2022-01-31 16:26:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:37,378 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 3343 transitions. [2022-01-31 16:26:37,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 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-01-31 16:26:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3343 transitions. [2022-01-31 16:26:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-31 16:26:37,380 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:37,380 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 16:26:37,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 16:26:37,381 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -73974424, now seen corresponding path program 1 times [2022-01-31 16:26:37,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:37,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915659472] [2022-01-31 16:26:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:37,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 16:26:37,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:37,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915659472] [2022-01-31 16:26:37,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915659472] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:37,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:37,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:26:37,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938840795] [2022-01-31 16:26:37,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:37,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:26:37,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:26:37,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:26:37,467 INFO L87 Difference]: Start difference. First operand 2302 states and 3343 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 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-01-31 16:26:38,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:39,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:40,728 INFO L93 Difference]: Finished difference Result 2677 states and 3888 transitions. [2022-01-31 16:26:40,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:26:40,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 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 172 [2022-01-31 16:26:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:40,731 INFO L225 Difference]: With dead ends: 2677 [2022-01-31 16:26:40,731 INFO L226 Difference]: Without dead ends: 2677 [2022-01-31 16:26:40,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:26:40,732 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 137 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:40,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 574 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-01-31 16:26:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-01-31 16:26:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2677. [2022-01-31 16:26:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4535928143712575) internal successors, (3884), 2672 states have internal predecessors, (3884), 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-01-31 16:26:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3888 transitions. [2022-01-31 16:26:40,750 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3888 transitions. Word has length 172 [2022-01-31 16:26:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:40,750 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3888 transitions. [2022-01-31 16:26:40,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 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-01-31 16:26:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3888 transitions. [2022-01-31 16:26:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-01-31 16:26:40,752 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:40,752 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:26:40,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 16:26:40,753 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash -516462024, now seen corresponding path program 1 times [2022-01-31 16:26:40,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:40,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052116419] [2022-01-31 16:26:40,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:40,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-01-31 16:26:40,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:40,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052116419] [2022-01-31 16:26:40,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052116419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:40,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:40,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:26:40,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961374030] [2022-01-31 16:26:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:40,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:26:40,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:26:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:26:40,871 INFO L87 Difference]: Start difference. First operand 2677 states and 3888 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:26:42,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:44,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:45,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:46,989 INFO L93 Difference]: Finished difference Result 2831 states and 4094 transitions. [2022-01-31 16:26:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:26:46,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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 180 [2022-01-31 16:26:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:46,992 INFO L225 Difference]: With dead ends: 2831 [2022-01-31 16:26:46,992 INFO L226 Difference]: Without dead ends: 2831 [2022-01-31 16:26:46,992 INFO L932 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-01-31 16:26:46,992 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 41 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:46,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 602 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 484 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-01-31 16:26:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2022-01-31 16:26:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2677. [2022-01-31 16:26:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4509730538922156) internal successors, (3877), 2672 states have internal predecessors, (3877), 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-01-31 16:26:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3881 transitions. [2022-01-31 16:26:47,010 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3881 transitions. Word has length 180 [2022-01-31 16:26:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:47,010 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3881 transitions. [2022-01-31 16:26:47,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:26:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3881 transitions. [2022-01-31 16:26:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-31 16:26:47,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:47,013 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:26:47,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 16:26:47,013 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 664470330, now seen corresponding path program 1 times [2022-01-31 16:26:47,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:47,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034430483] [2022-01-31 16:26:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:47,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:47,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-01-31 16:26:47,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:47,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034430483] [2022-01-31 16:26:47,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034430483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:47,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:47,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:26:47,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749693173] [2022-01-31 16:26:47,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:47,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:26:47,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:47,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:26:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:26:47,112 INFO L87 Difference]: Start difference. First operand 2677 states and 3881 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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-01-31 16:26:48,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:50,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:52,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:52,983 INFO L93 Difference]: Finished difference Result 3144 states and 4500 transitions. [2022-01-31 16:26:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:26:52,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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 202 [2022-01-31 16:26:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:52,986 INFO L225 Difference]: With dead ends: 3144 [2022-01-31 16:26:52,986 INFO L226 Difference]: Without dead ends: 3144 [2022-01-31 16:26:52,986 INFO L932 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-01-31 16:26:52,986 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 123 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:52,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 380 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-01-31 16:26:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2022-01-31 16:26:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2677. [2022-01-31 16:26:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4431137724550898) internal successors, (3856), 2672 states have internal predecessors, (3856), 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-01-31 16:26:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3860 transitions. [2022-01-31 16:26:53,009 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3860 transitions. Word has length 202 [2022-01-31 16:26:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:53,009 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3860 transitions. [2022-01-31 16:26:53,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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-01-31 16:26:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3860 transitions. [2022-01-31 16:26:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-31 16:26:53,011 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:53,012 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:26:53,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 16:26:53,012 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1023181626, now seen corresponding path program 1 times [2022-01-31 16:26:53,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:53,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193938708] [2022-01-31 16:26:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:53,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:53,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-01-31 16:26:53,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:53,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193938708] [2022-01-31 16:26:53,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193938708] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:53,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:53,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:26:53,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931091313] [2022-01-31 16:26:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:53,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:26:53,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:53,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:26:53,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:26:53,108 INFO L87 Difference]: Start difference. First operand 2677 states and 3860 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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-01-31 16:26:54,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:56,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:58,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:26:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:26:59,042 INFO L93 Difference]: Finished difference Result 3144 states and 4459 transitions. [2022-01-31 16:26:59,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:26:59,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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 202 [2022-01-31 16:26:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:26:59,045 INFO L225 Difference]: With dead ends: 3144 [2022-01-31 16:26:59,045 INFO L226 Difference]: Without dead ends: 3144 [2022-01-31 16:26:59,045 INFO L932 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-01-31 16:26:59,046 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 125 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:26:59,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 415 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-01-31 16:26:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2022-01-31 16:26:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2677. [2022-01-31 16:26:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4277694610778444) internal successors, (3815), 2672 states have internal predecessors, (3815), 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-01-31 16:26:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3819 transitions. [2022-01-31 16:26:59,066 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3819 transitions. Word has length 202 [2022-01-31 16:26:59,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:26:59,066 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3819 transitions. [2022-01-31 16:26:59,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 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-01-31 16:26:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3819 transitions. [2022-01-31 16:26:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-01-31 16:26:59,069 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:26:59,069 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:26:59,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 16:26:59,069 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:26:59,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:26:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash -770439321, now seen corresponding path program 1 times [2022-01-31 16:26:59,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:26:59,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089119071] [2022-01-31 16:26:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:26:59,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:26:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:59,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:26:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:26:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-01-31 16:26:59,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:26:59,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089119071] [2022-01-31 16:26:59,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089119071] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:26:59,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:26:59,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:26:59,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370005181] [2022-01-31 16:26:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:26:59,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:26:59,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:26:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:26:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:26:59,213 INFO L87 Difference]: Start difference. First operand 2677 states and 3819 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:27:01,940 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-01-31 16:27:03,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:27:04,610 INFO L93 Difference]: Finished difference Result 2803 states and 3989 transitions. [2022-01-31 16:27:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:27:04,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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 203 [2022-01-31 16:27:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:27:04,613 INFO L225 Difference]: With dead ends: 2803 [2022-01-31 16:27:04,613 INFO L226 Difference]: Without dead ends: 2803 [2022-01-31 16:27:04,613 INFO L932 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-01-31 16:27:04,613 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 39 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:27:04,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 591 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 465 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-01-31 16:27:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2022-01-31 16:27:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2677. [2022-01-31 16:27:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4251497005988023) internal successors, (3808), 2672 states have internal predecessors, (3808), 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-01-31 16:27:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3812 transitions. [2022-01-31 16:27:04,630 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3812 transitions. Word has length 203 [2022-01-31 16:27:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:27:04,631 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3812 transitions. [2022-01-31 16:27:04,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:27:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3812 transitions. [2022-01-31 16:27:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-01-31 16:27:04,633 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:27:04,633 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:27:04,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 16:27:04,634 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:27:04,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:27:04,634 INFO L85 PathProgramCache]: Analyzing trace with hash 926528038, now seen corresponding path program 1 times [2022-01-31 16:27:04,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:27:04,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36938106] [2022-01-31 16:27:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:27:04,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:27:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:27:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-01-31 16:27:04,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:27:04,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36938106] [2022-01-31 16:27:04,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36938106] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:27:04,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:27:04,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:27:04,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808427654] [2022-01-31 16:27:04,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:27:04,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:27:04,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:27:04,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:27:04,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:27:04,749 INFO L87 Difference]: Start difference. First operand 2677 states and 3812 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:27:06,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:08,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:10,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:11,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:27:12,140 INFO L93 Difference]: Finished difference Result 3144 states and 4424 transitions. [2022-01-31 16:27:12,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:27:12,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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 203 [2022-01-31 16:27:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:27:12,143 INFO L225 Difference]: With dead ends: 3144 [2022-01-31 16:27:12,143 INFO L226 Difference]: Without dead ends: 3144 [2022-01-31 16:27:12,143 INFO L932 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-01-31 16:27:12,144 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 122 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:27:12,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 368 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-01-31 16:27:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2022-01-31 16:27:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2677. [2022-01-31 16:27:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4146706586826348) internal successors, (3780), 2672 states have internal predecessors, (3780), 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-01-31 16:27:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3784 transitions. [2022-01-31 16:27:12,164 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3784 transitions. Word has length 203 [2022-01-31 16:27:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:27:12,165 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3784 transitions. [2022-01-31 16:27:12,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 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-01-31 16:27:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3784 transitions. [2022-01-31 16:27:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-31 16:27:12,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:27:12,168 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:27:12,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 16:27:12,168 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:27:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:27:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash -806903239, now seen corresponding path program 1 times [2022-01-31 16:27:12,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:27:12,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881610482] [2022-01-31 16:27:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:27:12,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:27:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:27:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:27:12,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:27:12,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881610482] [2022-01-31 16:27:12,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881610482] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:27:12,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:27:12,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:27:12,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732668801] [2022-01-31 16:27:12,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:27:12,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:27:12,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:27:12,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:27:12,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:27:12,276 INFO L87 Difference]: Start difference. First operand 2677 states and 3784 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 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-01-31 16:27:13,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:14,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:16,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:17,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:27:18,040 INFO L93 Difference]: Finished difference Result 3021 states and 4263 transitions. [2022-01-31 16:27:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:27:18,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 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 205 [2022-01-31 16:27:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:27:18,042 INFO L225 Difference]: With dead ends: 3021 [2022-01-31 16:27:18,043 INFO L226 Difference]: Without dead ends: 3021 [2022-01-31 16:27:18,043 INFO L932 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-01-31 16:27:18,043 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 34 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:27:18,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 591 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-01-31 16:27:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2022-01-31 16:27:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2887. [2022-01-31 16:27:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2882 states have (on average 1.4136016655100625) internal successors, (4074), 2882 states have internal predecessors, (4074), 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-01-31 16:27:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4078 transitions. [2022-01-31 16:27:18,078 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4078 transitions. Word has length 205 [2022-01-31 16:27:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:27:18,079 INFO L470 AbstractCegarLoop]: Abstraction has 2887 states and 4078 transitions. [2022-01-31 16:27:18,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 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-01-31 16:27:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4078 transitions. [2022-01-31 16:27:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-01-31 16:27:18,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:27:18,082 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:27:18,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 16:27:18,082 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:27:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:27:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -737010179, now seen corresponding path program 1 times [2022-01-31 16:27:18,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:27:18,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595768456] [2022-01-31 16:27:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:27:18,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:27:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:18,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:27:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:27:18,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:27:18,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595768456] [2022-01-31 16:27:18,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595768456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:27:18,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:27:18,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:27:18,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687942395] [2022-01-31 16:27:18,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:27:18,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:27:18,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:27:18,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:27:18,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:27:18,338 INFO L87 Difference]: Start difference. First operand 2887 states and 4078 transitions. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 6 states have internal predecessors, (143), 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-01-31 16:27:19,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:21,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:22,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:24,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:27:25,905 INFO L93 Difference]: Finished difference Result 3372 states and 4729 transitions. [2022-01-31 16:27:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:27:25,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 6 states have internal predecessors, (143), 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 211 [2022-01-31 16:27:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:27:25,908 INFO L225 Difference]: With dead ends: 3372 [2022-01-31 16:27:25,908 INFO L226 Difference]: Without dead ends: 3372 [2022-01-31 16:27:25,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:27:25,909 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 275 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 110 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:27:25,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 477 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 537 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-01-31 16:27:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2022-01-31 16:27:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 2940. [2022-01-31 16:27:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2940 states, 2935 states have (on average 1.415672913117547) internal successors, (4155), 2935 states have internal predecessors, (4155), 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-01-31 16:27:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2940 states and 4159 transitions. [2022-01-31 16:27:25,948 INFO L78 Accepts]: Start accepts. Automaton has 2940 states and 4159 transitions. Word has length 211 [2022-01-31 16:27:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:27:25,948 INFO L470 AbstractCegarLoop]: Abstraction has 2940 states and 4159 transitions. [2022-01-31 16:27:25,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 6 states have internal predecessors, (143), 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-01-31 16:27:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4159 transitions. [2022-01-31 16:27:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-01-31 16:27:25,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:27:25,951 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:27:25,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 16:27:25,951 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:27:25,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:27:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash 65109109, now seen corresponding path program 1 times [2022-01-31 16:27:25,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:27:25,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994856250] [2022-01-31 16:27:25,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:27:25,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:27:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:27:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-01-31 16:27:26,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:27:26,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994856250] [2022-01-31 16:27:26,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994856250] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:27:26,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:27:26,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:27:26,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047017556] [2022-01-31 16:27:26,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:27:26,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:27:26,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:27:26,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:27:26,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:27:26,155 INFO L87 Difference]: Start difference. First operand 2940 states and 4159 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-01-31 16:27:27,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:29,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:30,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:32,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:34,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:27:35,409 INFO L93 Difference]: Finished difference Result 4823 states and 6741 transitions. [2022-01-31 16:27:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:27:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 212 [2022-01-31 16:27:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:27:35,414 INFO L225 Difference]: With dead ends: 4823 [2022-01-31 16:27:35,414 INFO L226 Difference]: Without dead ends: 4823 [2022-01-31 16:27:35,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:27:35,415 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 317 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:27:35,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 853 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 800 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2022-01-31 16:27:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2022-01-31 16:27:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 3143. [2022-01-31 16:27:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3143 states, 3138 states have (on average 1.4133205863607394) internal successors, (4435), 3138 states have internal predecessors, (4435), 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-01-31 16:27:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 4439 transitions. [2022-01-31 16:27:35,446 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 4439 transitions. Word has length 212 [2022-01-31 16:27:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:27:35,446 INFO L470 AbstractCegarLoop]: Abstraction has 3143 states and 4439 transitions. [2022-01-31 16:27:35,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-01-31 16:27:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 4439 transitions. [2022-01-31 16:27:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-01-31 16:27:35,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:27:35,450 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:27:35,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 16:27:35,450 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:27:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:27:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash -960382890, now seen corresponding path program 1 times [2022-01-31 16:27:35,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:27:35,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882396123] [2022-01-31 16:27:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:27:35,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:27:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:27:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:27:35,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:27:35,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882396123] [2022-01-31 16:27:35,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882396123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:27:35,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:27:35,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:27:35,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250692545] [2022-01-31 16:27:35,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:27:35,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:27:35,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:27:35,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:27:35,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:27:35,639 INFO L87 Difference]: Start difference. First operand 3143 states and 4439 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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-01-31 16:27:38,029 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-01-31 16:27:40,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:42,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:27:42,573 INFO L93 Difference]: Finished difference Result 3588 states and 5033 transitions. [2022-01-31 16:27:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:27:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 212 [2022-01-31 16:27:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:27:42,578 INFO L225 Difference]: With dead ends: 3588 [2022-01-31 16:27:42,578 INFO L226 Difference]: Without dead ends: 3574 [2022-01-31 16:27:42,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:27:42,578 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 243 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 106 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:27:42,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 383 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 469 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-01-31 16:27:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2022-01-31 16:27:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3154. [2022-01-31 16:27:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3154 states, 3149 states have (on average 1.4134645919339472) internal successors, (4451), 3149 states have internal predecessors, (4451), 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-01-31 16:27:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 4455 transitions. [2022-01-31 16:27:42,602 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 4455 transitions. Word has length 212 [2022-01-31 16:27:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:27:42,602 INFO L470 AbstractCegarLoop]: Abstraction has 3154 states and 4455 transitions. [2022-01-31 16:27:42,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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-01-31 16:27:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 4455 transitions. [2022-01-31 16:27:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-01-31 16:27:42,606 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:27:42,606 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:27:42,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 16:27:42,606 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:27:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:27:42,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2000111424, now seen corresponding path program 1 times [2022-01-31 16:27:42,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:27:42,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460111652] [2022-01-31 16:27:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:27:42,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:27:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:27:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-01-31 16:27:42,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:27:42,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460111652] [2022-01-31 16:27:42,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460111652] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:27:42,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190317054] [2022-01-31 16:27:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:27:42,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:27:42,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:27:42,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:27:42,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 16:27:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:43,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 16:27:43,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:27:43,897 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:27:43,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-01-31 16:27:43,946 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 16:27:43,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 16:27:44,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-01-31 16:27:44,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:27:44,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-01-31 16:27:44,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-01-31 16:27:44,221 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-01-31 16:27:44,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-01-31 16:27:44,305 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-01-31 16:27:44,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-01-31 16:27:44,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-01-31 16:27:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 140 proven. 101 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-01-31 16:27:44,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:27:44,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-01-31 16:27:44,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-01-31 16:27:46,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (not (= 8545 (select (select (store |c_#memory_int| v_arrayElimCell_10 (store (select |c_#memory_int| v_arrayElimCell_10) (+ 844 v_arrayElimCell_11) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset))))) is different from false [2022-01-31 16:27:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-01-31 16:27:46,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190317054] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 16:27:46,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-31 16:27:46,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 10] total 14 [2022-01-31 16:27:46,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131801075] [2022-01-31 16:27:46,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:27:46,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:27:46,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:27:46,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:27:46,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-01-31 16:27:46,655 INFO L87 Difference]: Start difference. First operand 3154 states and 4455 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:27:47,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:49,094 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 8545 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))) (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (not (= 8545 (select (select (store |c_#memory_int| v_arrayElimCell_10 (store (select |c_#memory_int| v_arrayElimCell_10) (+ 844 v_arrayElimCell_11) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))))) is different from false [2022-01-31 16:27:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:27:49,105 INFO L93 Difference]: Finished difference Result 3826 states and 5358 transitions. [2022-01-31 16:27:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:27:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (3), 1 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 240 [2022-01-31 16:27:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:27:49,110 INFO L225 Difference]: With dead ends: 3826 [2022-01-31 16:27:49,110 INFO L226 Difference]: Without dead ends: 3826 [2022-01-31 16:27:49,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=42, Invalid=146, Unknown=2, NotChecked=50, Total=240 [2022-01-31 16:27:49,111 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 115 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:27:49,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 430 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 238 Invalid, 0 Unknown, 191 Unchecked, 1.6s Time] [2022-01-31 16:27:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2022-01-31 16:27:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 2951. [2022-01-31 16:27:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2946 states have (on average 1.4086897488119483) internal successors, (4150), 2946 states have internal predecessors, (4150), 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-01-31 16:27:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4154 transitions. [2022-01-31 16:27:49,150 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 4154 transitions. Word has length 240 [2022-01-31 16:27:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:27:49,150 INFO L470 AbstractCegarLoop]: Abstraction has 2951 states and 4154 transitions. [2022-01-31 16:27:49,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:27:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4154 transitions. [2022-01-31 16:27:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-01-31 16:27:49,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:27:49,154 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-31 16:27:49,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 16:27:49,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-01-31 16:27:49,354 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:27:49,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:27:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash 837080913, now seen corresponding path program 1 times [2022-01-31 16:27:49,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:27:49,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857466567] [2022-01-31 16:27:49,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:27:49,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:27:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:27:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 290 proven. 56 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-31 16:27:49,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:27:49,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857466567] [2022-01-31 16:27:49,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857466567] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:27:49,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752513381] [2022-01-31 16:27:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:27:49,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:27:49,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:27:49,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:27:49,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 16:27:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:27:50,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-31 16:27:50,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:27:50,628 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:27:50,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-01-31 16:27:50,675 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 16:27:50,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 16:27:50,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:27:50,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-01-31 16:27:50,873 INFO L353 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-01-31 16:27:50,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-01-31 16:27:50,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:27:50,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-01-31 16:27:51,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:27:51,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2022-01-31 16:27:51,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:27:51,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2022-01-31 16:27:51,739 INFO L353 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-01-31 16:27:51,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 65 [2022-01-31 16:27:51,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-01-31 16:27:51,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-01-31 16:27:51,802 INFO L353 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-01-31 16:27:51,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-01-31 16:27:51,820 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:27:51,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 16:27:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-31 16:27:51,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:27:52,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2022-01-31 16:27:52,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 136 [2022-01-31 16:27:52,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 130 [2022-01-31 16:27:52,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 224 [2022-01-31 16:27:54,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) is different from false [2022-01-31 16:27:54,567 INFO L353 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-01-31 16:27:54,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 1 [2022-01-31 16:27:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-01-31 16:27:54,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752513381] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 16:27:54,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 16:27:54,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 25 [2022-01-31 16:27:54,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444614669] [2022-01-31 16:27:54,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 16:27:54,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 16:27:54,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:27:54,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 16:27:54,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=460, Unknown=1, NotChecked=44, Total=600 [2022-01-31 16:27:54,702 INFO L87 Difference]: Start difference. First operand 2951 states and 4154 transitions. Second operand has 25 states, 25 states have (on average 12.2) internal successors, (305), 24 states have internal predecessors, (305), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:27:57,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:27:59,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:28:01,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:28:04,142 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-01-31 16:28:05,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:28:07,619 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (= (select .cse3 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse3 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-01-31 16:28:09,688 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (<= (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8448)) is different from false [2022-01-31 16:28:12,380 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))) (and (let ((.cse5 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse5))) (let ((.cse2 (select (select |c_#memory_int| .cse3) (+ 844 .cse1)))) (let ((.cse0 (<= .cse4 .cse2))) (or (and .cse0 (not (= (+ 792 .cse1) c_ssl3_accept_~s.offset))) (and .cse0 (<= .cse2 8448)) (and .cse0 (not (= .cse3 c_ssl3_accept_~s.base)))))))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse7 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse8 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse6 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse8 8448)))) (store .cse6 v_arrayElimCell_28 (store (select .cse6 v_arrayElimCell_28) .cse7 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse8)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse7) 8672)))) (<= .cse4 8448))) is different from false [2022-01-31 16:28:14,638 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (or (= (select .cse3 (+ 92 c_ssl3_accept_~s.offset)) 0) (let ((.cse4 (+ 84 c_ssl3_accept_~s.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse4) c_ssl3_accept_~s.base) (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse4)))))) (= (select .cse3 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse3 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-01-31 16:28:16,139 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (or (= (select .cse3 (+ 92 c_ssl3_accept_~s.offset)) 0) (let ((.cse4 (+ 84 c_ssl3_accept_~s.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse4) c_ssl3_accept_~s.base) (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse4)))))) (<= (select .cse3 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-01-31 16:28:18,669 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse9 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse5 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse10))) (let ((.cse3 (= .cse5 c_ssl3_accept_~s.base)) (.cse1 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse10)) (.cse4 (select .cse9 (+ 52 c_ssl3_accept_~s.offset)))) (and (let ((.cse2 (select (select |c_#memory_int| .cse5) (+ 844 .cse1)))) (let ((.cse0 (<= .cse4 .cse2))) (or (and .cse0 (not (= (+ 792 .cse1) c_ssl3_accept_~s.offset))) (and .cse0 (<= .cse2 8448)) (and .cse0 (not .cse3))))) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse7 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse8 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse6 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse8 8448)))) (store .cse6 v_arrayElimCell_28 (store (select .cse6 v_arrayElimCell_28) .cse7 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse8)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse7) 8672)))) (or (= (select .cse9 (+ 92 c_ssl3_accept_~s.offset)) 0) (and .cse3 (<= c_ssl3_accept_~s.offset (+ 752 .cse1)))) (<= .cse4 8448))))) is different from false [2022-01-31 16:28:20,955 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse8))) (let ((.cse4 (= .cse7 c_ssl3_accept_~s.base)) (.cse5 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse8)) (.cse3 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse6 (+ 52 c_ssl3_accept_~s.offset))) (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (or (= (select .cse3 (+ 92 c_ssl3_accept_~s.offset)) 0) (and .cse4 (<= c_ssl3_accept_~s.offset (+ 752 .cse5)))) (or (= |c_ssl3_accept_#t~mem145| 0) (and .cse4 (not (= .cse6 (+ 844 .cse5))) (= 8448 (select (select |c_#memory_int| .cse7) .cse6)))) (= (select .cse3 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse3 .cse6) 8448))))) is different from false [2022-01-31 16:28:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:28:21,140 INFO L93 Difference]: Finished difference Result 8475 states and 11960 transitions. [2022-01-31 16:28:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 16:28:21,140 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 12.2) internal successors, (305), 24 states have internal predecessors, (305), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 244 [2022-01-31 16:28:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:28:21,150 INFO L225 Difference]: With dead ends: 8475 [2022-01-31 16:28:21,150 INFO L226 Difference]: Without dead ends: 8475 [2022-01-31 16:28:21,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=306, Invalid=1610, Unknown=8, NotChecked=728, Total=2652 [2022-01-31 16:28:21,151 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 700 mSDsluCounter, 4567 mSDsCounter, 0 mSdLazyCounter, 3707 mSolverCounterSat, 125 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 4983 SdHoareTripleChecker+Invalid, 5905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 3707 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 2071 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:28:21,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 4983 Invalid, 5905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 3707 Invalid, 2 Unknown, 2071 Unchecked, 14.4s Time] [2022-01-31 16:28:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8475 states. [2022-01-31 16:28:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8475 to 5673. [2022-01-31 16:28:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5673 states, 5668 states have (on average 1.4467184191954834) internal successors, (8200), 5668 states have internal predecessors, (8200), 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-01-31 16:28:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5673 states to 5673 states and 8204 transitions. [2022-01-31 16:28:21,207 INFO L78 Accepts]: Start accepts. Automaton has 5673 states and 8204 transitions. Word has length 244 [2022-01-31 16:28:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:28:21,207 INFO L470 AbstractCegarLoop]: Abstraction has 5673 states and 8204 transitions. [2022-01-31 16:28:21,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.2) internal successors, (305), 24 states have internal predecessors, (305), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:28:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 5673 states and 8204 transitions. [2022-01-31 16:28:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-01-31 16:28:21,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:28:21,213 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-31 16:28:21,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 16:28:21,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-01-31 16:28:21,414 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:28:21,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:28:21,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1577342628, now seen corresponding path program 1 times [2022-01-31 16:28:21,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:28:21,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699194766] [2022-01-31 16:28:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:28:21,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:28:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:28:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:28:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:28:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 228 proven. 182 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-01-31 16:28:21,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:28:21,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699194766] [2022-01-31 16:28:21,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699194766] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:28:21,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257627327] [2022-01-31 16:28:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:28:21,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:28:21,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:28:21,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:28:21,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 16:28:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:28:22,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 1406 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-31 16:28:22,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:28:22,788 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:28:22,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-01-31 16:28:22,833 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 16:28:22,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 16:28:23,028 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:28:23,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 16:28:23,040 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:28:23,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 16:28:23,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:28:23,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-01-31 16:28:23,085 INFO L353 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-01-31 16:28:23,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-01-31 16:28:23,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:28:23,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-01-31 16:28:23,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:28:23,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-01-31 16:28:23,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:28:23,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-01-31 16:28:23,945 INFO L353 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-01-31 16:28:23,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 37 [2022-01-31 16:28:23,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-01-31 16:28:23,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-01-31 16:28:23,997 INFO L353 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-01-31 16:28:23,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-01-31 16:28:24,012 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:28:24,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 16:28:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-31 16:28:24,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:28:24,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2022-01-31 16:28:24,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 136 [2022-01-31 16:28:24,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 130 [2022-01-31 16:28:24,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 224 [2022-01-31 16:28:26,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_53)) (.cse0 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse0) v_arrayElimCell_51) .cse1) 8672) (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse0 .cse3 8448)))) (store .cse2 v_arrayElimCell_51 (store (select .cse2 v_arrayElimCell_51) .cse1 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse3)) 8640))))) is different from false [2022-01-31 16:28:28,392 INFO L353 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-01-31 16:28:28,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 1 [2022-01-31 16:28:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-01-31 16:28:28,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257627327] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 16:28:28,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 16:28:28,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 29 [2022-01-31 16:28:28,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005812566] [2022-01-31 16:28:28,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 16:28:28,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 16:28:28,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:28:28,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 16:28:28,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=649, Unknown=1, NotChecked=52, Total=812 [2022-01-31 16:28:28,526 INFO L87 Difference]: Start difference. First operand 5673 states and 8204 transitions. Second operand has 29 states, 29 states have (on average 12.0) internal successors, (348), 28 states have internal predecessors, (348), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:28:30,539 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-01-31 16:28:33,538 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_53)) (.cse0 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse0) v_arrayElimCell_51) .cse1) 8672) (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse0 .cse3 8448)))) (store .cse2 v_arrayElimCell_51 (store (select .cse2 v_arrayElimCell_51) .cse1 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse3)) 8640))))) (not (= (select .cse4 (+ 92 c_ssl3_accept_~s.offset)) 0)) (= (select .cse4 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse4 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-01-31 16:28:35,616 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_53)) (.cse0 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse0) v_arrayElimCell_51) .cse1) 8672) (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse0 .cse3 8448)))) (store .cse2 v_arrayElimCell_51 (store (select .cse2 v_arrayElimCell_51) .cse1 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse3)) 8640))))) (<= (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8448)) is different from false [2022-01-31 16:28:38,455 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse2 (select .cse7 (+ 92 c_ssl3_accept_~s.offset)))) (let ((.cse0 (+ 84 c_ssl3_accept_~s.offset)) (.cse1 (= .cse2 0))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse0))) .cse1) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse0) c_ssl3_accept_~s.base) .cse1) (or (= .cse2 |c_ssl3_accept_#t~mem145|) (not (= |c_ssl3_accept_#t~mem145| 0))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse4 (+ 844 v_arrayElimCell_53)) (.cse3 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse3) v_arrayElimCell_51) .cse4) 8672) (not (= (let ((.cse6 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse5 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse3 .cse6 8448)))) (store .cse5 v_arrayElimCell_51 (store (select .cse5 v_arrayElimCell_51) .cse4 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse6)) 8640))))) (= (select .cse7 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse7 (+ 52 c_ssl3_accept_~s.offset)) 8448))))) is different from false [2022-01-31 16:28:40,671 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse2 (select .cse7 (+ 92 c_ssl3_accept_~s.offset)))) (let ((.cse0 (+ 84 c_ssl3_accept_~s.offset)) (.cse1 (= .cse2 0))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse0))) .cse1) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse0) c_ssl3_accept_~s.base) .cse1) (or (= .cse2 |c_ssl3_accept_#t~mem145|) (not (= |c_ssl3_accept_#t~mem145| 0))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse4 (+ 844 v_arrayElimCell_53)) (.cse3 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse3) v_arrayElimCell_51) .cse4) 8672) (not (= (let ((.cse6 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse5 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse3 .cse6 8448)))) (store .cse5 v_arrayElimCell_51 (store (select .cse5 v_arrayElimCell_51) .cse4 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse6)) 8640))))) (not .cse1) (= (select .cse7 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse7 (+ 52 c_ssl3_accept_~s.offset)) 8448))))) is different from false [2022-01-31 16:28:42,483 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (+ 84 c_ssl3_accept_~s.offset)) (.cse1 (= (select .cse6 (+ 92 c_ssl3_accept_~s.offset)) 0))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse0))) .cse1) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse0) c_ssl3_accept_~s.base) .cse1) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_53)) (.cse2 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse2) v_arrayElimCell_51) .cse3) 8672) (not (= (let ((.cse5 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse4 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse2 .cse5 8448)))) (store .cse4 v_arrayElimCell_51 (store (select .cse4 v_arrayElimCell_51) .cse3 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse5)) 8640))))) (<= (select .cse6 (+ 52 c_ssl3_accept_~s.offset)) 8448)))) is different from false [2022-01-31 16:28:45,350 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))) (let ((.cse5 (<= .cse0 8448))) (and (let ((.cse6 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse6))) (let ((.cse3 (= (+ 792 .cse2) c_ssl3_accept_~s.offset)) (.cse4 (= .cse1 c_ssl3_accept_~s.base))) (or (and (<= .cse0 (select (select |c_#memory_int| .cse1) (+ 844 .cse2))) (or (not .cse3) (not .cse4))) (and .cse3 .cse4 .cse5))))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse8 (+ 844 v_arrayElimCell_53)) (.cse7 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse7) v_arrayElimCell_51) .cse8) 8672) (not (= (let ((.cse10 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse9 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse7 .cse10 8448)))) (store .cse9 v_arrayElimCell_51 (store (select .cse9 v_arrayElimCell_51) .cse8 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse10)) 8640))))) .cse5))) is different from false [2022-01-31 16:28:48,687 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_53)) (.cse0 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse0) v_arrayElimCell_51) .cse1) 8672) (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse0 .cse3 8448)))) (store .cse2 v_arrayElimCell_51 (store (select .cse2 v_arrayElimCell_51) .cse1 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse3)) 8640))))) (= (select .cse4 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse4 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-01-31 16:28:51,145 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (+ 84 c_ssl3_accept_~s.offset)) (.cse1 (= (select .cse6 (+ 92 c_ssl3_accept_~s.offset)) 0))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse0))) .cse1) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse0) c_ssl3_accept_~s.base) .cse1) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_53)) (.cse2 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse2) v_arrayElimCell_51) .cse3) 8672) (not (= (let ((.cse5 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse4 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse2 .cse5 8448)))) (store .cse4 v_arrayElimCell_51 (store (select .cse4 v_arrayElimCell_51) .cse3 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse5)) 8640))))) (= (select .cse6 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse6 (+ 52 c_ssl3_accept_~s.offset)) 8448)))) is different from false [2022-01-31 16:28:52,734 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse17 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse17)) (.cse15 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse10 (+ 52 c_ssl3_accept_~s.offset))) (let ((.cse2 (select .cse15 .cse10)) (.cse8 (select .cse15 (+ 92 c_ssl3_accept_~s.offset))) (.cse16 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse17)) (.cse6 (= (+ 792 .cse0) c_ssl3_accept_~s.offset))) (let ((.cse9 (= |c_ssl3_accept_#t~mem145| 0)) (.cse4 (not .cse6)) (.cse5 (= .cse16 c_ssl3_accept_~s.base)) (.cse3 (select |c_#memory_int| .cse16)) (.cse1 (= .cse8 0)) (.cse7 (<= .cse2 8448))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 .cse0)) .cse1) (or (and (<= .cse2 (select .cse3 (+ 844 .cse0))) (or .cse4 (not .cse5))) (and .cse6 .cse5 .cse7)) (or .cse5 .cse1) (or (= .cse8 |c_ssl3_accept_#t~mem145|) (not .cse9)) (or .cse9 (and .cse4 .cse5 (= 8448 (select .cse3 .cse10)))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse12 (+ 844 v_arrayElimCell_53)) (.cse11 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse11) v_arrayElimCell_51) .cse12) 8672) (not (= (let ((.cse14 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse13 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse11 .cse14 8448)))) (store .cse13 v_arrayElimCell_51 (store (select .cse13 v_arrayElimCell_51) .cse12 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse14)) 8640))))) (not .cse1) (= (select .cse15 (+ 64 c_ssl3_accept_~s.offset)) 0) .cse7))))) is different from false [2022-01-31 16:28:55,184 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 84 c_ssl3_accept_~s.offset)) (.cse11 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse2 (select .cse11 (+ 52 c_ssl3_accept_~s.offset))) (.cse3 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse12)) (.cse5 (= .cse3 c_ssl3_accept_~s.base)) (.cse1 (= (select .cse11 (+ 92 c_ssl3_accept_~s.offset)) 0)) (.cse6 (<= .cse2 8448))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 .cse0)) .cse1) (let ((.cse4 (= (+ 792 .cse0) c_ssl3_accept_~s.offset))) (or (and (<= .cse2 (select (select |c_#memory_int| .cse3) (+ 844 .cse0))) (or (not .cse4) (not .cse5))) (and .cse4 .cse5 .cse6))) (or .cse5 .cse1) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse8 (+ 844 v_arrayElimCell_53)) (.cse7 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse7) v_arrayElimCell_51) .cse8) 8672) (not (= (let ((.cse10 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse9 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse7 .cse10 8448)))) (store .cse9 v_arrayElimCell_51 (store (select .cse9 v_arrayElimCell_51) .cse8 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse10)) 8640))))) .cse6)))) is different from false [2022-01-31 16:28:58,858 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (+ 84 c_ssl3_accept_~s.offset)) (.cse1 (= (select .cse6 (+ 92 c_ssl3_accept_~s.offset)) 0))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse0))) .cse1) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse0) c_ssl3_accept_~s.base) .cse1) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_53)) (.cse2 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse2) v_arrayElimCell_51) .cse3) 8672) (not (= (let ((.cse5 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse4 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse2 .cse5 8448)))) (store .cse4 v_arrayElimCell_51 (store (select .cse4 v_arrayElimCell_51) .cse3 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse5)) 8640))))) (not .cse1) (= (select .cse6 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse6 (+ 52 c_ssl3_accept_~s.offset)) 8448)))) is different from false [2022-01-31 16:29:00,935 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base)) (.cse6 (+ 176 c_ssl3_accept_~s.offset)) (.cse13 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse4 (+ 92 c_ssl3_accept_~s.offset))) (let ((.cse8 (select .cse13 .cse4)) (.cse3 (select .cse7 .cse6))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base)) (.cse1 (+ 84 c_ssl3_accept_~s.offset)) (.cse5 (= .cse3 c_ssl3_accept_~s.base)) (.cse2 (= .cse8 0))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select .cse0 .cse1))) .cse2) (or (not (= (select (select |c_#memory_int| .cse3) .cse4) 0)) (not .cse5) (= (+ (select .cse0 .cse6) 172) .cse4)) (or (= (select .cse7 .cse1) c_ssl3_accept_~s.base) .cse2) (or (= .cse8 |c_ssl3_accept_#t~mem145|) (not (= |c_ssl3_accept_#t~mem145| 0))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse10 (+ 844 v_arrayElimCell_53)) (.cse9 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse9) v_arrayElimCell_51) .cse10) 8672) (not (= (let ((.cse12 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse11 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse9 .cse12 8448)))) (store .cse11 v_arrayElimCell_51 (store (select .cse11 v_arrayElimCell_51) .cse10 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse12)) 8640))))) (or .cse5 (not .cse2)) (= (select .cse13 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse13 (+ 52 c_ssl3_accept_~s.offset)) 8448))))) is different from false [2022-01-31 16:29:02,267 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (select .cse5 (+ 92 c_ssl3_accept_~s.offset)))) (and (or (= .cse0 |c_ssl3_accept_#t~mem145|) (not (= |c_ssl3_accept_#t~mem145| 0))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse2 (+ 844 v_arrayElimCell_53)) (.cse1 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse1) v_arrayElimCell_51) .cse2) 8672) (not (= (let ((.cse4 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse3 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse1 .cse4 8448)))) (store .cse3 v_arrayElimCell_51 (store (select .cse3 v_arrayElimCell_51) .cse2 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse4)) 8640))))) (not (= .cse0 0)) (= (select .cse5 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse5 (+ 52 c_ssl3_accept_~s.offset)) 8448)))) is different from false [2022-01-31 16:29:05,016 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse14))) (let ((.cse12 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse7 (+ 52 c_ssl3_accept_~s.offset)) (.cse13 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse14)) (.cse6 (= (+ 792 .cse0) c_ssl3_accept_~s.offset))) (let ((.cse4 (not .cse6)) (.cse5 (= .cse13 c_ssl3_accept_~s.base)) (.cse3 (select |c_#memory_int| .cse13)) (.cse2 (select .cse12 .cse7)) (.cse1 (= (select .cse12 (+ 92 c_ssl3_accept_~s.offset)) 0))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 .cse0)) .cse1) (or (and (<= .cse2 (select .cse3 (+ 844 .cse0))) (or .cse4 (not .cse5))) (and .cse6 .cse5 (<= .cse2 8448))) (or .cse5 .cse1) (or (= |c_ssl3_accept_#t~mem145| 0) (and .cse4 .cse5 (= 8448 (select .cse3 .cse7)))) (= 8448 .cse2) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse9 (+ 844 v_arrayElimCell_53)) (.cse8 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse8) v_arrayElimCell_51) .cse9) 8672) (not (= (let ((.cse11 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse10 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse8 .cse11 8448)))) (store .cse10 v_arrayElimCell_51 (store (select .cse10 v_arrayElimCell_51) .cse9 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse11)) 8640))))) (not .cse1) (= (select .cse12 (+ 64 c_ssl3_accept_~s.offset)) 0)))))) is different from false [2022-01-31 16:29:06,612 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 84 c_ssl3_accept_~s.offset)) (.cse11 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse2 (select .cse11 (+ 52 c_ssl3_accept_~s.offset))) (.cse3 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse12))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse12)) (.cse5 (= .cse3 c_ssl3_accept_~s.base)) (.cse1 (= (select .cse11 (+ 92 c_ssl3_accept_~s.offset)) 0)) (.cse6 (<= .cse2 8448))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 .cse0)) .cse1) (let ((.cse4 (= (+ 792 .cse0) c_ssl3_accept_~s.offset))) (or (and (<= .cse2 (select (select |c_#memory_int| .cse3) (+ 844 .cse0))) (or (not .cse4) (not .cse5))) (and .cse4 .cse5 .cse6))) (or .cse5 .cse1) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse8 (+ 844 v_arrayElimCell_53)) (.cse7 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse7) v_arrayElimCell_51) .cse8) 8672) (not (= (let ((.cse10 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse9 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse7 .cse10 8448)))) (store .cse9 v_arrayElimCell_51 (store (select .cse9 v_arrayElimCell_51) .cse8 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse10)) 8640))))) (not .cse1) (= (select .cse11 (+ 64 c_ssl3_accept_~s.offset)) 0) .cse6)))) is different from false [2022-01-31 16:29:09,133 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (select .cse1 (+ 92 c_ssl3_accept_~s.offset)))) (and (or (= .cse0 |c_ssl3_accept_#t~mem145|) (not (= |c_ssl3_accept_#t~mem145| 0))) (= 8448 (select .cse1 (+ 52 c_ssl3_accept_~s.offset))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_53)) (.cse2 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse2) v_arrayElimCell_51) .cse3) 8672) (not (= (let ((.cse5 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse4 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse2 .cse5 8448)))) (store .cse4 v_arrayElimCell_51 (store (select .cse4 v_arrayElimCell_51) .cse3 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse5)) 8640))))) (not (= .cse0 0)) (= (select .cse1 (+ 64 c_ssl3_accept_~s.offset)) 0)))) is different from false [2022-01-31 16:29:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:29:09,200 INFO L93 Difference]: Finished difference Result 37363 states and 52098 transitions. [2022-01-31 16:29:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-01-31 16:29:09,201 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 28 states have internal predecessors, (348), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 245 [2022-01-31 16:29:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:29:09,242 INFO L225 Difference]: With dead ends: 37363 [2022-01-31 16:29:09,242 INFO L226 Difference]: Without dead ends: 37363 [2022-01-31 16:29:09,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 519 SyntacticMatches, 21 SemanticMatches, 157 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 8182 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=2429, Invalid=17644, Unknown=17, NotChecked=5032, Total=25122 [2022-01-31 16:29:09,244 INFO L933 BasicCegarLoop]: 495 mSDtfsCounter, 3374 mSDsluCounter, 8507 mSDsCounter, 0 mSdLazyCounter, 7590 mSolverCounterSat, 620 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3374 SdHoareTripleChecker+Valid, 9002 SdHoareTripleChecker+Invalid, 13166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 7590 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4955 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:29:09,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3374 Valid, 9002 Invalid, 13166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 7590 Invalid, 1 Unknown, 4955 Unchecked, 8.9s Time] [2022-01-31 16:29:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37363 states. [2022-01-31 16:29:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37363 to 27866. [2022-01-31 16:29:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27866 states, 27861 states have (on average 1.413660672624816) internal successors, (39386), 27861 states have internal predecessors, (39386), 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-01-31 16:29:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27866 states to 27866 states and 39390 transitions. [2022-01-31 16:29:09,609 INFO L78 Accepts]: Start accepts. Automaton has 27866 states and 39390 transitions. Word has length 245 [2022-01-31 16:29:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:29:09,610 INFO L470 AbstractCegarLoop]: Abstraction has 27866 states and 39390 transitions. [2022-01-31 16:29:09,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 28 states have internal predecessors, (348), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:29:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 27866 states and 39390 transitions. [2022-01-31 16:29:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-01-31 16:29:09,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:29:09,689 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-31 16:29:09,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 16:29:09,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:29:09,906 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:29:09,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:29:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1642236613, now seen corresponding path program 1 times [2022-01-31 16:29:09,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:29:09,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349629753] [2022-01-31 16:29:09,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:29:09,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:29:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:29:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-01-31 16:29:10,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:29:10,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349629753] [2022-01-31 16:29:10,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349629753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:29:10,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:29:10,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:29:10,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375723765] [2022-01-31 16:29:10,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:29:10,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:29:10,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:29:10,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:29:10,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:29:10,241 INFO L87 Difference]: Start difference. First operand 27866 states and 39390 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 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-01-31 16:29:12,911 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-01-31 16:29:14,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:16,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:18,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:29:19,860 INFO L93 Difference]: Finished difference Result 45225 states and 62952 transitions. [2022-01-31 16:29:19,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:29:19,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 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 245 [2022-01-31 16:29:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:29:19,910 INFO L225 Difference]: With dead ends: 45225 [2022-01-31 16:29:19,910 INFO L226 Difference]: Without dead ends: 45225 [2022-01-31 16:29:19,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:29:19,910 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 357 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 52 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:29:19,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 998 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1053 Invalid, 3 Unknown, 0 Unchecked, 9.5s Time] [2022-01-31 16:29:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45225 states. [2022-01-31 16:29:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45225 to 28096. [2022-01-31 16:29:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28096 states, 28091 states have (on average 1.4160763233775941) internal successors, (39779), 28091 states have internal predecessors, (39779), 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-01-31 16:29:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28096 states to 28096 states and 39783 transitions. [2022-01-31 16:29:20,416 INFO L78 Accepts]: Start accepts. Automaton has 28096 states and 39783 transitions. Word has length 245 [2022-01-31 16:29:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:29:20,416 INFO L470 AbstractCegarLoop]: Abstraction has 28096 states and 39783 transitions. [2022-01-31 16:29:20,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 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-01-31 16:29:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 28096 states and 39783 transitions. [2022-01-31 16:29:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-01-31 16:29:20,491 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:29:20,491 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-31 16:29:20,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 16:29:20,491 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:29:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:29:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2124535176, now seen corresponding path program 1 times [2022-01-31 16:29:20,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:29:20,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076926498] [2022-01-31 16:29:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:29:20,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:29:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:29:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 291 proven. 2 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-01-31 16:29:20,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:29:20,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076926498] [2022-01-31 16:29:20,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076926498] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:29:20,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728778325] [2022-01-31 16:29:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:29:21,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:29:21,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:29:21,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:29:21,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 16:29:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:21,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-31 16:29:21,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:29:22,023 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:29:22,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-01-31 16:29:22,061 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 16:29:22,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 16:29:22,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-31 16:29:22,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:29:22,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-01-31 16:29:22,247 INFO L353 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-01-31 16:29:22,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-01-31 16:29:22,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:29:22,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-01-31 16:29:22,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:29:22,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-01-31 16:29:22,745 INFO L353 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-01-31 16:29:22,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 37 [2022-01-31 16:29:22,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:29:22,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-01-31 16:29:22,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-01-31 16:29:22,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-01-31 16:29:22,805 INFO L353 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-01-31 16:29:22,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-01-31 16:29:22,819 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:29:22,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 16:29:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-31 16:29:22,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:29:23,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-01-31 16:29:23,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 16:29:23,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-01-31 16:29:23,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-01-31 16:29:23,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2022-01-31 16:29:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-01-31 16:29:23,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728778325] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 16:29:23,764 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 16:29:23,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-01-31 16:29:23,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499770929] [2022-01-31 16:29:23,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 16:29:23,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 16:29:23,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:29:23,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 16:29:23,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2022-01-31 16:29:23,765 INFO L87 Difference]: Start difference. First operand 28096 states and 39783 transitions. Second operand has 26 states, 26 states have (on average 11.653846153846153) internal successors, (303), 25 states have internal predecessors, (303), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:29:25,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:27,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:29,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:31,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:33,426 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:35,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:36,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:38,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:29:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:29:44,032 INFO L93 Difference]: Finished difference Result 64339 states and 89768 transitions. [2022-01-31 16:29:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-01-31 16:29:44,033 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.653846153846153) internal successors, (303), 25 states have internal predecessors, (303), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 245 [2022-01-31 16:29:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:29:44,107 INFO L225 Difference]: With dead ends: 64339 [2022-01-31 16:29:44,107 INFO L226 Difference]: Without dead ends: 64339 [2022-01-31 16:29:44,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 499 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=873, Invalid=3957, Unknown=0, NotChecked=0, Total=4830 [2022-01-31 16:29:44,110 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 2050 mSDsluCounter, 3732 mSDsCounter, 0 mSdLazyCounter, 4450 mSolverCounterSat, 488 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 4075 SdHoareTripleChecker+Invalid, 5883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 4450 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 939 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:29:44,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2050 Valid, 4075 Invalid, 5883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 4450 Invalid, 6 Unknown, 939 Unchecked, 19.0s Time] [2022-01-31 16:29:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64339 states. [2022-01-31 16:29:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64339 to 13449. [2022-01-31 16:29:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13449 states, 13444 states have (on average 1.4261380541505504) internal successors, (19173), 13444 states have internal predecessors, (19173), 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-01-31 16:29:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13449 states to 13449 states and 19177 transitions. [2022-01-31 16:29:44,576 INFO L78 Accepts]: Start accepts. Automaton has 13449 states and 19177 transitions. Word has length 245 [2022-01-31 16:29:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:29:44,577 INFO L470 AbstractCegarLoop]: Abstraction has 13449 states and 19177 transitions. [2022-01-31 16:29:44,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.653846153846153) internal successors, (303), 25 states have internal predecessors, (303), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:29:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13449 states and 19177 transitions. [2022-01-31 16:29:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-01-31 16:29:44,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:29:44,587 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-01-31 16:29:44,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 16:29:44,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:29:44,805 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:29:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:29:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash -295147377, now seen corresponding path program 1 times [2022-01-31 16:29:44,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:29:44,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578608522] [2022-01-31 16:29:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:29:44,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:29:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:29:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 370 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-31 16:29:45,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:29:45,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578608522] [2022-01-31 16:29:45,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578608522] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:29:45,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921680966] [2022-01-31 16:29:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:29:45,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:29:45,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:29:45,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:29:45,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 16:29:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:46,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 16:29:46,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:29:46,192 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:29:46,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-01-31 16:29:46,229 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 16:29:46,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 16:29:46,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-01-31 16:29:46,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:29:46,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-01-31 16:29:46,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-01-31 16:29:46,380 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-01-31 16:29:46,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-01-31 16:29:46,431 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-01-31 16:29:46,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-01-31 16:29:47,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:29:47,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-01-31 16:29:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 363 proven. 68 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-31 16:29:47,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:29:47,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-01-31 16:29:47,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-01-31 16:29:48,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_85 Int) (v_arrayElimCell_86 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_85 (store (select |c_#memory_int| v_arrayElimCell_85) (+ 844 v_arrayElimCell_86) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8656))) is different from false [2022-01-31 16:29:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-01-31 16:29:48,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921680966] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 16:29:48,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-31 16:29:48,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 10] total 19 [2022-01-31 16:29:48,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736896088] [2022-01-31 16:29:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:29:48,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:29:48,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:29:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:29:48,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=258, Unknown=1, NotChecked=32, Total=342 [2022-01-31 16:29:48,824 INFO L87 Difference]: Start difference. First operand 13449 states and 19177 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:29:50,834 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-01-31 16:29:53,084 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_85 Int) (v_arrayElimCell_86 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_85 (store (select |c_#memory_int| v_arrayElimCell_85) (+ 844 v_arrayElimCell_86) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8656))) (not (= 8656 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset))))) is different from false [2022-01-31 16:29:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:29:53,117 INFO L93 Difference]: Finished difference Result 17211 states and 24421 transitions. [2022-01-31 16:29:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:29:53,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 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 256 [2022-01-31 16:29:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:29:53,135 INFO L225 Difference]: With dead ends: 17211 [2022-01-31 16:29:53,136 INFO L226 Difference]: Without dead ends: 17211 [2022-01-31 16:29:53,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=58, Invalid=290, Unknown=2, NotChecked=70, Total=420 [2022-01-31 16:29:53,136 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 102 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:29:53,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 605 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 244 Invalid, 1 Unknown, 226 Unchecked, 2.2s Time] [2022-01-31 16:29:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17211 states. [2022-01-31 16:29:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17211 to 15273. [2022-01-31 16:29:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15273 states, 15268 states have (on average 1.4278228975635316) internal successors, (21800), 15268 states have internal predecessors, (21800), 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-01-31 16:29:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15273 states to 15273 states and 21804 transitions. [2022-01-31 16:29:53,319 INFO L78 Accepts]: Start accepts. Automaton has 15273 states and 21804 transitions. Word has length 256 [2022-01-31 16:29:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:29:53,319 INFO L470 AbstractCegarLoop]: Abstraction has 15273 states and 21804 transitions. [2022-01-31 16:29:53,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:29:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 15273 states and 21804 transitions. [2022-01-31 16:29:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-01-31 16:29:53,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:29:53,335 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-01-31 16:29:53,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-31 16:29:53,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:29:53,551 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:29:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:29:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash -768666320, now seen corresponding path program 1 times [2022-01-31 16:29:53,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:29:53,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53101345] [2022-01-31 16:29:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:29:53,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:29:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:53,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:29:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 372 proven. 68 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 16:29:53,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:29:53,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53101345] [2022-01-31 16:29:53,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53101345] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:29:53,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419320053] [2022-01-31 16:29:53,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:29:53,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:29:53,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:29:53,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:29:53,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 16:29:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:29:54,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 1434 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 16:29:54,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:29:54,748 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:29:54,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-01-31 16:29:54,782 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 16:29:54,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 16:29:54,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-01-31 16:29:54,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:29:54,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-01-31 16:29:54,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-01-31 16:29:54,923 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-01-31 16:29:54,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-01-31 16:29:54,972 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-01-31 16:29:54,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-01-31 16:29:56,059 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:29:56,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-01-31 16:29:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 363 proven. 68 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-31 16:29:56,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:29:56,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-01-31 16:29:56,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-01-31 16:29:58,016 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (not (= 8656 (select (select (store |c_#memory_int| v_arrayElimCell_97 (store (select |c_#memory_int| v_arrayElimCell_97) (+ 844 v_arrayElimCell_98) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset))))) is different from false [2022-01-31 16:29:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-01-31 16:29:58,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419320053] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 16:29:58,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-31 16:29:58,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 10] total 17 [2022-01-31 16:29:58,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977762778] [2022-01-31 16:29:58,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:29:58,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:29:58,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:29:58,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:29:58,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=202, Unknown=1, NotChecked=28, Total=272 [2022-01-31 16:29:58,124 INFO L87 Difference]: Start difference. First operand 15273 states and 21804 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:29:59,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:00,969 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 8656 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))) (forall ((v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (not (= 8656 (select (select (store |c_#memory_int| v_arrayElimCell_97 (store (select |c_#memory_int| v_arrayElimCell_97) (+ 844 v_arrayElimCell_98) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))))) is different from false [2022-01-31 16:30:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:30:00,999 INFO L93 Difference]: Finished difference Result 17229 states and 24452 transitions. [2022-01-31 16:30:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:30:01,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 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 256 [2022-01-31 16:30:01,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:30:01,017 INFO L225 Difference]: With dead ends: 17229 [2022-01-31 16:30:01,017 INFO L226 Difference]: Without dead ends: 17229 [2022-01-31 16:30:01,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 510 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=47, Invalid=231, Unknown=2, NotChecked=62, Total=342 [2022-01-31 16:30:01,018 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 102 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:30:01,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 639 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 245 Invalid, 0 Unknown, 265 Unchecked, 2.0s Time] [2022-01-31 16:30:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17229 states. [2022-01-31 16:30:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17229 to 15073. [2022-01-31 16:30:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15073 states, 15068 states have (on average 1.4271967082559065) internal successors, (21505), 15068 states have internal predecessors, (21505), 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-01-31 16:30:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15073 states to 15073 states and 21509 transitions. [2022-01-31 16:30:01,193 INFO L78 Accepts]: Start accepts. Automaton has 15073 states and 21509 transitions. Word has length 256 [2022-01-31 16:30:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:30:01,193 INFO L470 AbstractCegarLoop]: Abstraction has 15073 states and 21509 transitions. [2022-01-31 16:30:01,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:30:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 15073 states and 21509 transitions. [2022-01-31 16:30:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-31 16:30:01,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:30:01,227 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2022-01-31 16:30:01,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-31 16:30:01,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:30:01,449 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:30:01,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:30:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash -529743717, now seen corresponding path program 1 times [2022-01-31 16:30:01,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:30:01,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255019445] [2022-01-31 16:30:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:30:01,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:30:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:01,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:30:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-01-31 16:30:01,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:30:01,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255019445] [2022-01-31 16:30:01,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255019445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:30:01,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:30:01,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:30:01,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361675852] [2022-01-31 16:30:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:30:01,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:30:01,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:30:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:30:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:30:01,660 INFO L87 Difference]: Start difference. First operand 15073 states and 21509 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 7 states have internal predecessors, (159), 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-01-31 16:30:03,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:05,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:07,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:09,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:11,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:30:13,802 INFO L93 Difference]: Finished difference Result 19577 states and 27325 transitions. [2022-01-31 16:30:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:30:13,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 7 states have internal predecessors, (159), 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 257 [2022-01-31 16:30:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:30:13,820 INFO L225 Difference]: With dead ends: 19577 [2022-01-31 16:30:13,820 INFO L226 Difference]: Without dead ends: 19517 [2022-01-31 16:30:13,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:30:13,821 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 236 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 39 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:30:13,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 1180 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1336 Invalid, 2 Unknown, 0 Unchecked, 12.0s Time] [2022-01-31 16:30:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19517 states. [2022-01-31 16:30:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19517 to 15052. [2022-01-31 16:30:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15052 states, 15047 states have (on average 1.4250016614607564) internal successors, (21442), 15047 states have internal predecessors, (21442), 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-01-31 16:30:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15052 states to 15052 states and 21446 transitions. [2022-01-31 16:30:14,007 INFO L78 Accepts]: Start accepts. Automaton has 15052 states and 21446 transitions. Word has length 257 [2022-01-31 16:30:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:30:14,007 INFO L470 AbstractCegarLoop]: Abstraction has 15052 states and 21446 transitions. [2022-01-31 16:30:14,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 7 states have internal predecessors, (159), 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-01-31 16:30:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15052 states and 21446 transitions. [2022-01-31 16:30:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-31 16:30:14,020 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:30:14,021 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-01-31 16:30:14,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 16:30:14,021 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:30:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:30:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1971038234, now seen corresponding path program 1 times [2022-01-31 16:30:14,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:30:14,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811986236] [2022-01-31 16:30:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:30:14,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:30:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:30:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-01-31 16:30:14,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:30:14,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811986236] [2022-01-31 16:30:14,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811986236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:30:14,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:30:14,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:30:14,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434703266] [2022-01-31 16:30:14,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:30:14,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:30:14,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:30:14,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:30:14,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:30:14,242 INFO L87 Difference]: Start difference. First operand 15052 states and 21446 transitions. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 7 states have internal predecessors, (157), 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-01-31 16:30:16,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:18,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:20,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:22,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:30:24,128 INFO L93 Difference]: Finished difference Result 21257 states and 29738 transitions. [2022-01-31 16:30:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:30:24,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 7 states have internal predecessors, (157), 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 257 [2022-01-31 16:30:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:30:24,147 INFO L225 Difference]: With dead ends: 21257 [2022-01-31 16:30:24,148 INFO L226 Difference]: Without dead ends: 21257 [2022-01-31 16:30:24,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:30:24,148 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 458 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 87 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:30:24,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 1275 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1614 Invalid, 1 Unknown, 0 Unchecked, 9.7s Time] [2022-01-31 16:30:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21257 states. [2022-01-31 16:30:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21257 to 15612. [2022-01-31 16:30:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15612 states, 15607 states have (on average 1.4275645543666304) internal successors, (22280), 15607 states have internal predecessors, (22280), 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-01-31 16:30:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15612 states to 15612 states and 22284 transitions. [2022-01-31 16:30:24,312 INFO L78 Accepts]: Start accepts. Automaton has 15612 states and 22284 transitions. Word has length 257 [2022-01-31 16:30:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:30:24,312 INFO L470 AbstractCegarLoop]: Abstraction has 15612 states and 22284 transitions. [2022-01-31 16:30:24,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 7 states have internal predecessors, (157), 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-01-31 16:30:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 15612 states and 22284 transitions. [2022-01-31 16:30:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-01-31 16:30:24,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:30:24,325 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 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-01-31 16:30:24,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-31 16:30:24,325 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:30:24,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:30:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash -831762783, now seen corresponding path program 1 times [2022-01-31 16:30:24,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:30:24,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147129373] [2022-01-31 16:30:24,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:30:24,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:30:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:30:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-01-31 16:30:24,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:30:24,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147129373] [2022-01-31 16:30:24,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147129373] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:30:24,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856313782] [2022-01-31 16:30:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:30:24,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:30:24,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:30:24,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:30:24,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 16:30:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:25,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-31 16:30:25,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:30:25,675 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:30:25,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-01-31 16:30:25,708 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 16:30:25,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 16:30:25,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-01-31 16:30:25,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:30:25,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:30:25,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:30:25,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-01-31 16:30:25,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-01-31 16:30:25,915 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-01-31 16:30:25,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-01-31 16:30:25,964 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-01-31 16:30:25,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-01-31 16:30:26,510 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:30:26,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-01-31 16:30:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 299 proven. 104 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-01-31 16:30:26,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:30:26,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-01-31 16:30:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-01-31 16:30:26,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856313782] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 16:30:26,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-31 16:30:26,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 10] total 13 [2022-01-31 16:30:26,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963569751] [2022-01-31 16:30:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:30:26,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:30:26,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:30:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:30:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:30:26,835 INFO L87 Difference]: Start difference. First operand 15612 states and 22284 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:30:28,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:30:28,678 INFO L93 Difference]: Finished difference Result 17411 states and 24506 transitions. [2022-01-31 16:30:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:30:28,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 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 267 [2022-01-31 16:30:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:30:28,697 INFO L225 Difference]: With dead ends: 17411 [2022-01-31 16:30:28,697 INFO L226 Difference]: Without dead ends: 17411 [2022-01-31 16:30:28,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 532 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:30:28,697 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 117 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:30:28,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 408 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 16:30:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17411 states. [2022-01-31 16:30:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17411 to 16158. [2022-01-31 16:30:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16158 states, 16153 states have (on average 1.40778802699189) internal successors, (22740), 16153 states have internal predecessors, (22740), 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-01-31 16:30:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16158 states to 16158 states and 22744 transitions. [2022-01-31 16:30:28,853 INFO L78 Accepts]: Start accepts. Automaton has 16158 states and 22744 transitions. Word has length 267 [2022-01-31 16:30:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:30:28,853 INFO L470 AbstractCegarLoop]: Abstraction has 16158 states and 22744 transitions. [2022-01-31 16:30:28,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:30:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 16158 states and 22744 transitions. [2022-01-31 16:30:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-31 16:30:28,866 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:30:28,867 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 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-01-31 16:30:28,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 16:30:29,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:30:29,083 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:30:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:30:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 493430218, now seen corresponding path program 1 times [2022-01-31 16:30:29,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:30:29,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814589323] [2022-01-31 16:30:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:30:29,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:30:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:30:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 306 proven. 7 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-01-31 16:30:29,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:30:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814589323] [2022-01-31 16:30:29,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814589323] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:30:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255230873] [2022-01-31 16:30:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:30:29,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:30:29,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:30:29,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:30:29,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 16:30:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:30,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 16:30:30,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:30:30,389 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:30:30,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-01-31 16:30:30,430 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 16:30:30,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 16:30:30,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-01-31 16:30:30,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:30:30,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-01-31 16:30:30,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-01-31 16:30:30,670 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-01-31 16:30:30,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-01-31 16:30:30,716 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-01-31 16:30:30,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-01-31 16:30:30,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-01-31 16:30:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 301 proven. 103 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-01-31 16:30:30,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:30:30,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-01-31 16:30:30,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-01-31 16:30:31,771 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_119 (store (select |c_#memory_int| v_arrayElimCell_119) (+ v_arrayElimCell_120 844) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) is different from false [2022-01-31 16:30:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-01-31 16:30:31,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255230873] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 16:30:31,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-31 16:30:31,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 10] total 14 [2022-01-31 16:30:31,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655422072] [2022-01-31 16:30:31,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:30:31,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:30:31,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:30:31,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:30:31,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-01-31 16:30:31,939 INFO L87 Difference]: Start difference. First operand 16158 states and 22744 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:30:33,944 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-01-31 16:30:36,231 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_119 (store (select |c_#memory_int| v_arrayElimCell_119) (+ v_arrayElimCell_120 844) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) (not (= (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) is different from false [2022-01-31 16:30:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:30:36,297 INFO L93 Difference]: Finished difference Result 15730 states and 21817 transitions. [2022-01-31 16:30:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:30:36,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 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 268 [2022-01-31 16:30:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:30:36,318 INFO L225 Difference]: With dead ends: 15730 [2022-01-31 16:30:36,318 INFO L226 Difference]: Without dead ends: 15730 [2022-01-31 16:30:36,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 534 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=42, Invalid=146, Unknown=2, NotChecked=50, Total=240 [2022-01-31 16:30:36,319 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 116 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:30:36,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 476 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 237 Invalid, 1 Unknown, 199 Unchecked, 2.3s Time] [2022-01-31 16:30:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2022-01-31 16:30:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 6009. [2022-01-31 16:30:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6009 states, 6004 states have (on average 1.3837441705529647) internal successors, (8308), 6004 states have internal predecessors, (8308), 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-01-31 16:30:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 8312 transitions. [2022-01-31 16:30:36,409 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 8312 transitions. Word has length 268 [2022-01-31 16:30:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:30:36,409 INFO L470 AbstractCegarLoop]: Abstraction has 6009 states and 8312 transitions. [2022-01-31 16:30:36,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:30:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 8312 transitions. [2022-01-31 16:30:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-31 16:30:36,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:30:36,414 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:30:36,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-31 16:30:36,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-01-31 16:30:36,615 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:30:36,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:30:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1207140096, now seen corresponding path program 1 times [2022-01-31 16:30:36,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:30:36,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854142176] [2022-01-31 16:30:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:30:36,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:30:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:36,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:30:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-01-31 16:30:36,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:30:36,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854142176] [2022-01-31 16:30:36,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854142176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:30:36,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:30:36,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:30:36,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199499952] [2022-01-31 16:30:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:30:36,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:30:36,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:30:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:30:36,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:30:36,885 INFO L87 Difference]: Start difference. First operand 6009 states and 8312 transitions. Second operand has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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-01-31 16:30:38,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:40,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:41,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:43,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:30:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:30:45,409 INFO L93 Difference]: Finished difference Result 6017 states and 8322 transitions. [2022-01-31 16:30:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:30:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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 268 [2022-01-31 16:30:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:30:45,414 INFO L225 Difference]: With dead ends: 6017 [2022-01-31 16:30:45,414 INFO L226 Difference]: Without dead ends: 6009 [2022-01-31 16:30:45,414 INFO L932 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-01-31 16:30:45,415 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:30:45,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 842 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2022-01-31 16:30:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2022-01-31 16:30:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 6009. [2022-01-31 16:30:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6009 states, 6004 states have (on average 1.3835776149233845) internal successors, (8307), 6004 states have internal predecessors, (8307), 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-01-31 16:30:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 8311 transitions. [2022-01-31 16:30:45,496 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 8311 transitions. Word has length 268 [2022-01-31 16:30:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:30:45,496 INFO L470 AbstractCegarLoop]: Abstraction has 6009 states and 8311 transitions. [2022-01-31 16:30:45,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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-01-31 16:30:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 8311 transitions. [2022-01-31 16:30:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-31 16:30:45,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:30:45,501 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:30:45,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-01-31 16:30:45,501 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:30:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:30:45,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1691776927, now seen corresponding path program 1 times [2022-01-31 16:30:45,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:30:45,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561046004] [2022-01-31 16:30:45,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:30:45,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:30:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:46,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:30:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 291 proven. 209 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-01-31 16:30:46,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:30:46,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561046004] [2022-01-31 16:30:46,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561046004] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:30:46,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827167964] [2022-01-31 16:30:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:30:46,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:30:46,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:30:46,345 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:30:46,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 16:30:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:30:47,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-31 16:30:47,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:30:47,790 INFO L353 Elim1Store]: treesize reduction 73, result has 37.1 percent of original size [2022-01-31 16:30:47,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 120 [2022-01-31 16:30:47,821 INFO L353 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-01-31 16:30:47,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 216 [2022-01-31 16:30:47,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:47,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 155 [2022-01-31 16:30:47,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:47,872 INFO L353 Elim1Store]: treesize reduction 56, result has 49.5 percent of original size [2022-01-31 16:30:47,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 92 [2022-01-31 16:30:47,885 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:30:47,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-01-31 16:30:47,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2022-01-31 16:30:47,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-01-31 16:30:47,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-31 16:30:47,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:47,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:47,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:47,973 INFO L353 Elim1Store]: treesize reduction 60, result has 42.9 percent of original size [2022-01-31 16:30:47,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 120 [2022-01-31 16:30:47,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:47,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-01-31 16:30:48,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,031 INFO L353 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2022-01-31 16:30:48,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2022-01-31 16:30:48,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-01-31 16:30:48,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-01-31 16:30:48,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-01-31 16:30:48,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-31 16:30:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:48,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2022-01-31 16:30:48,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-01-31 16:30:48,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-01-31 16:30:48,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-01-31 16:30:48,447 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 16:30:48,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2022-01-31 16:30:48,491 INFO L353 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2022-01-31 16:30:48,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2022-01-31 16:30:48,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-01-31 16:30:48,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-01-31 16:30:48,592 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 16:30:48,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2022-01-31 16:30:48,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:30:49,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:49,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 131 [2022-01-31 16:30:49,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:49,605 INFO L353 Elim1Store]: treesize reduction 168, result has 34.6 percent of original size [2022-01-31 16:30:49,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 165 [2022-01-31 16:30:49,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:49,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 118 [2022-01-31 16:30:51,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:51,041 INFO L353 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2022-01-31 16:30:51,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 126 [2022-01-31 16:30:51,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:51,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-01-31 16:30:51,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:51,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-01-31 16:30:51,303 INFO L353 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-01-31 16:30:51,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 96 [2022-01-31 16:30:51,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-01-31 16:30:51,319 INFO L353 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-01-31 16:30:51,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 67 [2022-01-31 16:30:51,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:51,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2022-01-31 16:30:51,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:51,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2022-01-31 16:30:51,393 INFO L353 Elim1Store]: treesize reduction 49, result has 46.7 percent of original size [2022-01-31 16:30:51,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 56 [2022-01-31 16:30:52,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:52,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 105 [2022-01-31 16:30:52,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:52,107 INFO L353 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-01-31 16:30:52,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 68 [2022-01-31 16:30:52,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 71 [2022-01-31 16:30:53,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:30:53,541 INFO L353 Elim1Store]: treesize reduction 25, result has 44.4 percent of original size [2022-01-31 16:30:53,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 49 [2022-01-31 16:30:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 371 proven. 152 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:30:53,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:30:53,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 195 [2022-01-31 16:30:59,448 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-01-31 16:30:59,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 7490 treesize of output 1 [2022-01-31 16:30:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 371 proven. 152 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:30:59,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827167964] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 16:30:59,570 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 16:30:59,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 29 [2022-01-31 16:30:59,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806791917] [2022-01-31 16:30:59,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 16:30:59,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 16:30:59,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:30:59,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 16:30:59,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:30:59,571 INFO L87 Difference]: Start difference. First operand 6009 states and 8311 transitions. Second operand has 29 states, 28 states have (on average 19.964285714285715) internal successors, (559), 26 states have internal predecessors, (559), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:31:01,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:31:03,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:31:05,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:31:07,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:31:08,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:31:10,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:31:12,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:31:14,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:31:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:31:25,400 INFO L93 Difference]: Finished difference Result 26754 states and 37169 transitions. [2022-01-31 16:31:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-31 16:31:25,400 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 19.964285714285715) internal successors, (559), 26 states have internal predecessors, (559), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 268 [2022-01-31 16:31:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:31:25,426 INFO L225 Difference]: With dead ends: 26754 [2022-01-31 16:31:25,426 INFO L226 Difference]: Without dead ends: 26754 [2022-01-31 16:31:25,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 596 SyntacticMatches, 8 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1321, Invalid=6335, Unknown=0, NotChecked=0, Total=7656 [2022-01-31 16:31:25,427 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 5872 mSDsluCounter, 7450 mSDsCounter, 0 mSdLazyCounter, 7574 mSolverCounterSat, 1031 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5872 SdHoareTripleChecker+Valid, 7904 SdHoareTripleChecker+Invalid, 13109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1031 IncrementalHoareTripleChecker+Valid, 7574 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 4500 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:31:25,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5872 Valid, 7904 Invalid, 13109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1031 Valid, 7574 Invalid, 4 Unknown, 4500 Unchecked, 23.1s Time] [2022-01-31 16:31:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26754 states. [2022-01-31 16:31:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26754 to 16126. [2022-01-31 16:31:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16126 states, 16121 states have (on average 1.409279821351033) internal successors, (22719), 16121 states have internal predecessors, (22719), 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-01-31 16:31:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16126 states to 16126 states and 22723 transitions. [2022-01-31 16:31:25,646 INFO L78 Accepts]: Start accepts. Automaton has 16126 states and 22723 transitions. Word has length 268 [2022-01-31 16:31:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:31:25,647 INFO L470 AbstractCegarLoop]: Abstraction has 16126 states and 22723 transitions. [2022-01-31 16:31:25,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 19.964285714285715) internal successors, (559), 26 states have internal predecessors, (559), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:31:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16126 states and 22723 transitions. [2022-01-31 16:31:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-01-31 16:31:25,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:31:25,662 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 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-01-31 16:31:25,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 16:31:25,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-01-31 16:31:25,863 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:31:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:31:25,864 INFO L85 PathProgramCache]: Analyzing trace with hash -689929165, now seen corresponding path program 1 times [2022-01-31 16:31:25,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:31:25,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434483718] [2022-01-31 16:31:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:31:25,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:31:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:31:26,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:31:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:31:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 306 proven. 7 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-01-31 16:31:26,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:31:26,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434483718] [2022-01-31 16:31:26,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434483718] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:31:26,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604363420] [2022-01-31 16:31:26,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:31:26,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:31:26,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:31:26,048 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:31:26,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 16:31:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:31:27,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 1614 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 16:31:27,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:31:27,278 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:31:27,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-01-31 16:31:27,311 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 16:31:27,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 16:31:27,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-01-31 16:31:27,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:31:27,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-01-31 16:31:27,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-01-31 16:31:27,511 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-01-31 16:31:27,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-01-31 16:31:27,556 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-01-31 16:31:27,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-01-31 16:31:27,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-01-31 16:31:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 301 proven. 103 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-01-31 16:31:27,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:31:27,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-01-31 16:31:27,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-01-31 16:31:28,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_195 (store (select |c_#memory_int| v_arrayElimCell_195) (+ v_arrayElimCell_196 844) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) is different from false [2022-01-31 16:31:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-01-31 16:31:28,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604363420] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 16:31:28,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-31 16:31:28,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-01-31 16:31:28,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725092908] [2022-01-31 16:31:28,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:31:28,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:31:28,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:31:28,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:31:28,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2022-01-31 16:31:28,929 INFO L87 Difference]: Start difference. First operand 16126 states and 22723 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:31:30,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:31:32,773 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_195 (store (select |c_#memory_int| v_arrayElimCell_195) (+ v_arrayElimCell_196 844) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) (not (= (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) is different from false [2022-01-31 16:31:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:31:32,828 INFO L93 Difference]: Finished difference Result 17359 states and 24309 transitions. [2022-01-31 16:31:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 16:31:32,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 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 269 [2022-01-31 16:31:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:31:32,845 INFO L225 Difference]: With dead ends: 17359 [2022-01-31 16:31:32,845 INFO L226 Difference]: Without dead ends: 17359 [2022-01-31 16:31:32,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 538 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=35, Invalid=127, Unknown=2, NotChecked=46, Total=210 [2022-01-31 16:31:32,846 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 116 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:31:32,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 537 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 237 Invalid, 0 Unknown, 247 Unchecked, 1.9s Time] [2022-01-31 16:31:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2022-01-31 16:31:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15796. [2022-01-31 16:31:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15791 states have (on average 1.4099170413526692) internal successors, (22264), 15791 states have internal predecessors, (22264), 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-01-31 16:31:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 22268 transitions. [2022-01-31 16:31:32,999 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 22268 transitions. Word has length 269 [2022-01-31 16:31:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:31:32,999 INFO L470 AbstractCegarLoop]: Abstraction has 15796 states and 22268 transitions. [2022-01-31 16:31:32,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:31:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 22268 transitions. [2022-01-31 16:31:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-01-31 16:31:33,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:31:33,013 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:31:33,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 16:31:33,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-01-31 16:31:33,228 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:31:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:31:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -406402481, now seen corresponding path program 1 times [2022-01-31 16:31:33,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:31:33,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893019823] [2022-01-31 16:31:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:31:33,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:31:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:31:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:31:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:31:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-01-31 16:31:33,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:31:33,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893019823] [2022-01-31 16:31:33,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893019823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:31:33,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:31:33,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 16:31:33,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185108439] [2022-01-31 16:31:33,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:31:33,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 16:31:33,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:31:33,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 16:31:33,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:31:33,352 INFO L87 Difference]: Start difference. First operand 15796 states and 22268 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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-01-31 16:31:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:31:34,940 INFO L93 Difference]: Finished difference Result 28533 states and 39986 transitions. [2022-01-31 16:31:34,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 16:31:34,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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 270 [2022-01-31 16:31:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:31:34,972 INFO L225 Difference]: With dead ends: 28533 [2022-01-31 16:31:34,972 INFO L226 Difference]: Without dead ends: 28533 [2022-01-31 16:31:34,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 16:31:34,972 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 146 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:31:34,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 611 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 16:31:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28533 states. [2022-01-31 16:31:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28533 to 28240. [2022-01-31 16:31:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28240 states, 28235 states have (on average 1.4027625287763414) internal successors, (39607), 28235 states have internal predecessors, (39607), 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-01-31 16:31:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28240 states to 28240 states and 39611 transitions. [2022-01-31 16:31:35,285 INFO L78 Accepts]: Start accepts. Automaton has 28240 states and 39611 transitions. Word has length 270 [2022-01-31 16:31:35,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:31:35,286 INFO L470 AbstractCegarLoop]: Abstraction has 28240 states and 39611 transitions. [2022-01-31 16:31:35,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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-01-31 16:31:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28240 states and 39611 transitions. [2022-01-31 16:31:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-01-31 16:31:35,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:31:35,304 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:31:35,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-01-31 16:31:35,304 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:31:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:31:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash 461083870, now seen corresponding path program 1 times [2022-01-31 16:31:35,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:31:35,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792862514] [2022-01-31 16:31:35,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:31:35,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:31:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:31:36,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:31:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:31:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 298 proven. 205 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-01-31 16:31:36,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:31:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792862514] [2022-01-31 16:31:36,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792862514] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:31:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754036221] [2022-01-31 16:31:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:31:36,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:31:36,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:31:36,396 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:31:36,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 16:31:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:31:37,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 1620 conjuncts, 107 conjunts are in the unsatisfiable core [2022-01-31 16:31:37,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:31:37,942 INFO L353 Elim1Store]: treesize reduction 37, result has 45.6 percent of original size [2022-01-31 16:31:37,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 125 [2022-01-31 16:31:37,979 INFO L353 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-01-31 16:31:37,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 236 [2022-01-31 16:31:37,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:37,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 183 [2022-01-31 16:31:37,996 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:31:37,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 77 [2022-01-31 16:31:38,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,046 INFO L353 Elim1Store]: treesize reduction 56, result has 49.5 percent of original size [2022-01-31 16:31:38,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 158 [2022-01-31 16:31:38,080 INFO L353 Elim1Store]: treesize reduction 57, result has 50.0 percent of original size [2022-01-31 16:31:38,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 136 [2022-01-31 16:31:38,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-01-31 16:31:38,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-31 16:31:38,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 16:31:38,252 INFO L353 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2022-01-31 16:31:38,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2022-01-31 16:31:38,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-01-31 16:31:38,368 INFO L353 Elim1Store]: treesize reduction 39, result has 40.9 percent of original size [2022-01-31 16:31:38,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 43 [2022-01-31 16:31:38,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,455 INFO L353 Elim1Store]: treesize reduction 60, result has 42.9 percent of original size [2022-01-31 16:31:38,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 215 [2022-01-31 16:31:38,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-01-31 16:31:38,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-31 16:31:38,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,702 INFO L353 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-01-31 16:31:38,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-01-31 16:31:38,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-01-31 16:31:38,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,827 INFO L353 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2022-01-31 16:31:38,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 46 [2022-01-31 16:31:38,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:38,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-01-31 16:31:39,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-01-31 16:31:39,021 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 16:31:39,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-31 16:31:39,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 174 [2022-01-31 16:31:39,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:31:39,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 16:31:39,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2022-01-31 16:31:39,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:39,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-01-31 16:31:39,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 174 [2022-01-31 16:31:39,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:39,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:39,128 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:31:39,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 105 [2022-01-31 16:31:39,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-01-31 16:31:39,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2022-01-31 16:31:39,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:39,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 16:31:40,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 132 [2022-01-31 16:31:40,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,264 INFO L353 Elim1Store]: treesize reduction 184, result has 28.4 percent of original size [2022-01-31 16:31:40,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 159 [2022-01-31 16:31:40,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 130 [2022-01-31 16:31:40,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,520 INFO L353 Elim1Store]: treesize reduction 184, result has 28.4 percent of original size [2022-01-31 16:31:40,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 185 treesize of output 187 [2022-01-31 16:31:40,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 146 [2022-01-31 16:31:40,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 151 [2022-01-31 16:31:40,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 187 [2022-01-31 16:31:40,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,743 INFO L353 Elim1Store]: treesize reduction 168, result has 34.6 percent of original size [2022-01-31 16:31:40,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 206 treesize of output 197 [2022-01-31 16:31:40,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:40,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 138 [2022-01-31 16:31:43,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:43,205 INFO L353 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2022-01-31 16:31:43,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 192 [2022-01-31 16:31:43,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:43,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-01-31 16:31:43,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:43,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-01-31 16:31:43,532 INFO L353 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-01-31 16:31:43,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 96 [2022-01-31 16:31:43,543 INFO L353 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-01-31 16:31:43,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 77 [2022-01-31 16:31:43,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-01-31 16:31:43,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:43,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2022-01-31 16:31:43,612 INFO L353 Elim1Store]: treesize reduction 49, result has 46.7 percent of original size [2022-01-31 16:31:43,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 56 [2022-01-31 16:31:43,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:43,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 74 [2022-01-31 16:31:44,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2022-01-31 16:31:44,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,258 INFO L353 Elim1Store]: treesize reduction 77, result has 35.8 percent of original size [2022-01-31 16:31:44,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 90 [2022-01-31 16:31:44,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 93 [2022-01-31 16:31:44,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 89 [2022-01-31 16:31:44,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 95 [2022-01-31 16:31:44,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,376 INFO L353 Elim1Store]: treesize reduction 77, result has 35.8 percent of original size [2022-01-31 16:31:44,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 111 [2022-01-31 16:31:44,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 120 [2022-01-31 16:31:44,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:44,485 INFO L353 Elim1Store]: treesize reduction 127, result has 14.2 percent of original size [2022-01-31 16:31:44,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 101 [2022-01-31 16:31:44,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 92 [2022-01-31 16:31:45,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:45,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:45,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:31:45,900 INFO L353 Elim1Store]: treesize reduction 26, result has 61.2 percent of original size [2022-01-31 16:31:45,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 87 [2022-01-31 16:31:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 371 proven. 156 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:31:45,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:31:46,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 807 treesize of output 619 [2022-01-31 16:32:51,261 INFO L353 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2022-01-31 16:32:51,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 7539 treesize of output 1 [2022-01-31 16:32:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 371 proven. 156 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:32:51,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754036221] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 16:32:51,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 16:32:51,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 12] total 36 [2022-01-31 16:32:51,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388506432] [2022-01-31 16:32:51,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 16:32:51,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 16:32:51,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:32:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 16:32:51,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1077, Unknown=1, NotChecked=0, Total=1260 [2022-01-31 16:32:51,368 INFO L87 Difference]: Start difference. First operand 28240 states and 39611 transitions. Second operand has 36 states, 35 states have (on average 16.2) internal successors, (567), 33 states have internal predecessors, (567), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:32:53,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:32:55,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:32:57,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:32:58,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:33:00,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:33:01,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:33:02,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:33:04,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:33:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:33:13,287 INFO L93 Difference]: Finished difference Result 61766 states and 87924 transitions. [2022-01-31 16:33:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-31 16:33:13,287 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 16.2) internal successors, (567), 33 states have internal predecessors, (567), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 271 [2022-01-31 16:33:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:33:13,357 INFO L225 Difference]: With dead ends: 61766 [2022-01-31 16:33:13,357 INFO L226 Difference]: Without dead ends: 61766 [2022-01-31 16:33:13,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 570 SyntacticMatches, 19 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1227, Invalid=6254, Unknown=1, NotChecked=0, Total=7482 [2022-01-31 16:33:13,359 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 4490 mSDsluCounter, 7966 mSDsCounter, 0 mSdLazyCounter, 7167 mSolverCounterSat, 468 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4490 SdHoareTripleChecker+Valid, 8450 SdHoareTripleChecker+Invalid, 10899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 7167 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 3262 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:33:13,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4490 Valid, 8450 Invalid, 10899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 7167 Invalid, 2 Unknown, 3262 Unchecked, 19.0s Time] [2022-01-31 16:33:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61766 states. [2022-01-31 16:33:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61766 to 46750. [2022-01-31 16:33:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46750 states, 46745 states have (on average 1.4440474917103434) internal successors, (67502), 46745 states have internal predecessors, (67502), 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-01-31 16:33:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46750 states to 46750 states and 67506 transitions. [2022-01-31 16:33:13,963 INFO L78 Accepts]: Start accepts. Automaton has 46750 states and 67506 transitions. Word has length 271 [2022-01-31 16:33:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:33:13,963 INFO L470 AbstractCegarLoop]: Abstraction has 46750 states and 67506 transitions. [2022-01-31 16:33:13,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 16.2) internal successors, (567), 33 states have internal predecessors, (567), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:33:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 46750 states and 67506 transitions. [2022-01-31 16:33:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-01-31 16:33:13,996 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:33:13,996 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:33:14,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 16:33:14,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:33:14,200 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:33:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:33:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1649432768, now seen corresponding path program 1 times [2022-01-31 16:33:14,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:33:14,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714096673] [2022-01-31 16:33:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:33:14,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:33:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:33:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:33:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:33:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 460 proven. 186 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 16:33:14,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:33:14,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714096673] [2022-01-31 16:33:14,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714096673] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:33:14,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083337409] [2022-01-31 16:33:14,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:33:14,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:33:14,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:33:14,992 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:33:14,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 16:33:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:33:16,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 1620 conjuncts, 93 conjunts are in the unsatisfiable core [2022-01-31 16:33:16,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:33:16,492 INFO L353 Elim1Store]: treesize reduction 73, result has 37.1 percent of original size [2022-01-31 16:33:16,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 120 [2022-01-31 16:33:16,519 INFO L353 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-01-31 16:33:16,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 216 [2022-01-31 16:33:16,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:16,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 155 [2022-01-31 16:33:16,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:16,633 INFO L353 Elim1Store]: treesize reduction 56, result has 49.5 percent of original size [2022-01-31 16:33:16,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 92 [2022-01-31 16:33:16,644 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:33:16,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-01-31 16:33:16,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2022-01-31 16:33:16,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-01-31 16:33:16,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-31 16:33:16,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:16,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2022-01-31 16:33:16,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-01-31 16:33:16,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:16,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-01-31 16:33:16,825 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-01-31 16:33:16,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 113 [2022-01-31 16:33:16,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2022-01-31 16:33:16,875 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:33:16,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2022-01-31 16:33:16,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-01-31 16:33:17,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 96 [2022-01-31 16:33:17,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 84 [2022-01-31 16:33:17,379 INFO L353 Elim1Store]: treesize reduction 132, result has 25.8 percent of original size [2022-01-31 16:33:17,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 108 [2022-01-31 16:33:17,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,454 INFO L353 Elim1Store]: treesize reduction 69, result has 28.1 percent of original size [2022-01-31 16:33:17,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 123 [2022-01-31 16:33:17,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 108 [2022-01-31 16:33:17,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 105 [2022-01-31 16:33:17,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 132 [2022-01-31 16:33:17,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,557 INFO L353 Elim1Store]: treesize reduction 168, result has 34.6 percent of original size [2022-01-31 16:33:17,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 178 [2022-01-31 16:33:17,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:17,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 125 [2022-01-31 16:33:18,727 INFO L353 Elim1Store]: treesize reduction 72, result has 39.5 percent of original size [2022-01-31 16:33:18,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 131 [2022-01-31 16:33:18,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:18,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-01-31 16:33:18,910 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-31 16:33:18,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2022-01-31 16:33:18,934 INFO L353 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-01-31 16:33:18,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 96 [2022-01-31 16:33:18,944 INFO L353 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-01-31 16:33:18,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 77 [2022-01-31 16:33:18,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-01-31 16:33:18,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:18,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2022-01-31 16:33:18,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:18,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2022-01-31 16:33:19,018 INFO L353 Elim1Store]: treesize reduction 49, result has 46.7 percent of original size [2022-01-31 16:33:19,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 56 [2022-01-31 16:33:19,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:19,525 INFO L353 Elim1Store]: treesize reduction 77, result has 35.8 percent of original size [2022-01-31 16:33:19,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 90 [2022-01-31 16:33:19,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:19,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 99 [2022-01-31 16:33:19,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:19,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 93 [2022-01-31 16:33:19,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:19,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 95 [2022-01-31 16:33:19,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:19,619 INFO L353 Elim1Store]: treesize reduction 77, result has 35.8 percent of original size [2022-01-31 16:33:19,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 111 [2022-01-31 16:33:19,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:19,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 108 [2022-01-31 16:33:19,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 102 [2022-01-31 16:33:19,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 66 [2022-01-31 16:33:19,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:19,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:19,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:19,714 INFO L353 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2022-01-31 16:33:19,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 65 [2022-01-31 16:33:21,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:21,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:21,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:33:21,076 INFO L353 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2022-01-31 16:33:21,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 63 [2022-01-31 16:33:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 371 proven. 156 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:33:21,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:33:21,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 807 treesize of output 619 [2022-01-31 16:34:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 371 proven. 156 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:34:24,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083337409] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 16:34:24,085 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 16:34:24,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 35 [2022-01-31 16:34:24,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649401251] [2022-01-31 16:34:24,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 16:34:24,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 16:34:24,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:34:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 16:34:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1040, Unknown=1, NotChecked=0, Total=1190 [2022-01-31 16:34:24,087 INFO L87 Difference]: Start difference. First operand 46750 states and 67506 transitions. Second operand has 35 states, 35 states have (on average 15.057142857142857) internal successors, (527), 34 states have internal predecessors, (527), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:34:27,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:34:29,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:34:31,542 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:34:33,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:34:35,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:34:37,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:34:38,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 16:34:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:34:59,006 INFO L93 Difference]: Finished difference Result 200909 states and 290562 transitions. [2022-01-31 16:34:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-01-31 16:34:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 15.057142857142857) internal successors, (527), 34 states have internal predecessors, (527), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 271 [2022-01-31 16:34:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:34:59,419 INFO L225 Difference]: With dead ends: 200909 [2022-01-31 16:34:59,419 INFO L226 Difference]: Without dead ends: 200909 [2022-01-31 16:34:59,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 579 SyntacticMatches, 4 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7978 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3257, Invalid=21548, Unknown=1, NotChecked=0, Total=24806 [2022-01-31 16:34:59,420 INFO L933 BasicCegarLoop]: 929 mSDtfsCounter, 2342 mSDsluCounter, 15400 mSDsCounter, 0 mSdLazyCounter, 14701 mSolverCounterSat, 453 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 16329 SdHoareTripleChecker+Invalid, 20321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 14701 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 5163 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:34:59,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2342 Valid, 16329 Invalid, 20321 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [453 Valid, 14701 Invalid, 4 Unknown, 5163 Unchecked, 28.1s Time] [2022-01-31 16:34:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200909 states. [2022-01-31 16:35:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200909 to 168699. [2022-01-31 16:35:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168699 states, 168694 states have (on average 1.462025916748669) internal successors, (246635), 168694 states have internal predecessors, (246635), 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-01-31 16:35:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168699 states to 168699 states and 246639 transitions. [2022-01-31 16:35:02,356 INFO L78 Accepts]: Start accepts. Automaton has 168699 states and 246639 transitions. Word has length 271 [2022-01-31 16:35:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:35:02,356 INFO L470 AbstractCegarLoop]: Abstraction has 168699 states and 246639 transitions. [2022-01-31 16:35:02,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 15.057142857142857) internal successors, (527), 34 states have internal predecessors, (527), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 16:35:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 168699 states and 246639 transitions. [2022-01-31 16:35:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-01-31 16:35:02,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:35:02,565 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:35:02,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-31 16:35:02,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:35:02,766 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:35:02,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:35:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash 556252321, now seen corresponding path program 1 times [2022-01-31 16:35:02,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:35:02,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499974392] [2022-01-31 16:35:02,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:35:02,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:35:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:35:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:35:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:35:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 385 proven. 118 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-01-31 16:35:04,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:35:04,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499974392] [2022-01-31 16:35:04,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499974392] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 16:35:04,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146980501] [2022-01-31 16:35:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:35:04,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 16:35:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:35:04,392 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 16:35:04,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 16:35:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:35:05,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 97 conjunts are in the unsatisfiable core [2022-01-31 16:35:05,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 16:35:06,102 INFO L353 Elim1Store]: treesize reduction 73, result has 37.1 percent of original size [2022-01-31 16:35:06,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 120 [2022-01-31 16:35:06,128 INFO L353 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-01-31 16:35:06,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 216 [2022-01-31 16:35:06,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:06,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 155 [2022-01-31 16:35:06,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:06,184 INFO L353 Elim1Store]: treesize reduction 56, result has 49.5 percent of original size [2022-01-31 16:35:06,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 92 [2022-01-31 16:35:06,196 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:35:06,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-01-31 16:35:06,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2022-01-31 16:35:06,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-01-31 16:35:06,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-31 16:35:06,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2022-01-31 16:35:06,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-01-31 16:35:06,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:06,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2022-01-31 16:35:06,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:06,426 INFO L353 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2022-01-31 16:35:06,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 113 [2022-01-31 16:35:06,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-01-31 16:35:06,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2022-01-31 16:35:06,497 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 16:35:06,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2022-01-31 16:35:07,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 84 [2022-01-31 16:35:07,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,121 INFO L353 Elim1Store]: treesize reduction 69, result has 28.1 percent of original size [2022-01-31 16:35:07,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 108 [2022-01-31 16:35:07,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2022-01-31 16:35:07,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,238 INFO L353 Elim1Store]: treesize reduction 69, result has 28.1 percent of original size [2022-01-31 16:35:07,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 119 [2022-01-31 16:35:07,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 104 [2022-01-31 16:35:07,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 101 [2022-01-31 16:35:07,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 128 [2022-01-31 16:35:07,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,365 INFO L353 Elim1Store]: treesize reduction 144, result has 44.0 percent of original size [2022-01-31 16:35:07,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 135 treesize of output 198 [2022-01-31 16:35:07,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:07,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 147 [2022-01-31 16:35:09,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:09,478 INFO L353 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2022-01-31 16:35:09,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 142 [2022-01-31 16:35:09,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:09,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-01-31 16:35:09,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:09,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-01-31 16:35:09,801 INFO L353 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-01-31 16:35:09,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 96 [2022-01-31 16:35:09,813 INFO L353 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-01-31 16:35:09,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 77 [2022-01-31 16:35:09,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-01-31 16:35:09,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:09,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2022-01-31 16:35:09,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:09,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2022-01-31 16:35:09,887 INFO L353 Elim1Store]: treesize reduction 49, result has 46.7 percent of original size [2022-01-31 16:35:09,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 56 [2022-01-31 16:35:10,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:10,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 74 [2022-01-31 16:35:10,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:10,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2022-01-31 16:35:10,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:10,621 INFO L353 Elim1Store]: treesize reduction 77, result has 35.8 percent of original size [2022-01-31 16:35:10,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 90 [2022-01-31 16:35:10,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:10,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 89 [2022-01-31 16:35:10,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:10,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 95 [2022-01-31 16:35:10,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:10,738 INFO L353 Elim1Store]: treesize reduction 77, result has 35.8 percent of original size [2022-01-31 16:35:10,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 111 [2022-01-31 16:35:10,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 102 [2022-01-31 16:35:10,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 66 [2022-01-31 16:35:10,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:10,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:10,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 16:35:10,841 INFO L353 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2022-01-31 16:35:10,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 65 [2022-01-31 16:35:12,822 INFO L353 Elim1Store]: treesize reduction 14, result has 67.4 percent of original size [2022-01-31 16:35:12,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 63 [2022-01-31 16:35:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 371 proven. 156 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 16:35:12,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 16:35:13,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3285 treesize of output 2533