/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/loops/s3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 00:09:03,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 00:09:03,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 00:09:03,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 00:09:03,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 00:09:03,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 00:09:03,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 00:09:03,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 00:09:03,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 00:09:03,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 00:09:03,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 00:09:03,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 00:09:03,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 00:09:03,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 00:09:03,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 00:09:03,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 00:09:03,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 00:09:03,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 00:09:03,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 00:09:03,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 00:09:03,996 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 00:09:03,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 00:09:03,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 00:09:03,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 00:09:03,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 00:09:04,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 00:09:04,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 00:09:04,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 00:09:04,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 00:09:04,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 00:09:04,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 00:09:04,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 00:09:04,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 00:09:04,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 00:09:04,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 00:09:04,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 00:09:04,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 00:09:04,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 00:09:04,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 00:09:04,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 00:09:04,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 00:09:04,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 00:09:04,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-05 00:09:04,017 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 00:09:04,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 00:09:04,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 00:09:04,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-05 00:09:04,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 00:09:04,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-05 00:09:04,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 00:09:04,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 00:09:04,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 00:09:04,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 00:09:04,019 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-05 00:09:04,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 00:09:04,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 00:09:04,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 00:09:04,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 00:09:04,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 00:09:04,020 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-05 00:09:04,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 00:09:04,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 00:09:04,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 00:09:04,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 00:09:04,021 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 00:09:04,021 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-05 00:09:04,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 00:09:04,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 00:09:04,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 00:09:04,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 00:09:04,207 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 00:09:04,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2022-04-05 00:09:04,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68c2a2b7/a40ce871c3eb4f41ab1597428a04d4fd/FLAGa29d084c0 [2022-04-05 00:09:04,690 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 00:09:04,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2022-04-05 00:09:04,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68c2a2b7/a40ce871c3eb4f41ab1597428a04d4fd/FLAGa29d084c0 [2022-04-05 00:09:04,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68c2a2b7/a40ce871c3eb4f41ab1597428a04d4fd [2022-04-05 00:09:04,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 00:09:04,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 00:09:04,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 00:09:04,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 00:09:04,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 00:09:04,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:09:04" (1/1) ... [2022-04-05 00:09:04,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b703f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:04, skipping insertion in model container [2022-04-05 00:09:04,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:09:04" (1/1) ... [2022-04-05 00:09:04,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 00:09:04,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 00:09:05,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[64167,64180] [2022-04-05 00:09:05,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 00:09:05,046 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 00:09:05,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i[64167,64180] [2022-04-05 00:09:05,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 00:09:05,144 INFO L208 MainTranslator]: Completed translation [2022-04-05 00:09:05,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05 WrapperNode [2022-04-05 00:09:05,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 00:09:05,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 00:09:05,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 00:09:05,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 00:09:05,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05" (1/1) ... [2022-04-05 00:09:05,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05" (1/1) ... [2022-04-05 00:09:05,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05" (1/1) ... [2022-04-05 00:09:05,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05" (1/1) ... [2022-04-05 00:09:05,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05" (1/1) ... [2022-04-05 00:09:05,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05" (1/1) ... [2022-04-05 00:09:05,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05" (1/1) ... [2022-04-05 00:09:05,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 00:09:05,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 00:09:05,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 00:09:05,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 00:09:05,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05" (1/1) ... [2022-04-05 00:09:05,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 00:09:05,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 00:09:05,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-05 00:09:05,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 00:09:05,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 00:09:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 00:09:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-05 00:09:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-05 00:09:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 00:09:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-05 00:09:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-05 00:09:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-05 00:09:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-05 00:09:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 00:09:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 00:09:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 00:09:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 00:09:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-05 00:09:05,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 00:09:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-05 00:09:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-05 00:09:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-05 00:09:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-05 00:09:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-05 00:09:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-05 00:09:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-05 00:09:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-05 00:09:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 00:09:05,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-05 00:09:05,481 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 00:09:05,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 00:09:06,194 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 00:09:06,577 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-05 00:09:06,577 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-05 00:09:06,601 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 00:09:06,607 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 00:09:06,608 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 00:09:06,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:09:06 BoogieIcfgContainer [2022-04-05 00:09:06,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 00:09:06,610 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 00:09:06,610 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 00:09:06,614 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 00:09:06,616 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:09:06" (1/1) ... [2022-04-05 00:09:06,618 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-05 00:09:06,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 12:09:06 BasicIcfg [2022-04-05 00:09:06,664 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 00:09:06,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 00:09:06,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 00:09:06,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 00:09:06,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 12:09:04" (1/4) ... [2022-04-05 00:09:06,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241eceb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:09:06, skipping insertion in model container [2022-04-05 00:09:06,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:09:05" (2/4) ... [2022-04-05 00:09:06,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241eceb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:09:06, skipping insertion in model container [2022-04-05 00:09:06,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:09:06" (3/4) ... [2022-04-05 00:09:06,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241eceb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 12:09:06, skipping insertion in model container [2022-04-05 00:09:06,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 12:09:06" (4/4) ... [2022-04-05 00:09:06,674 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.iJordan [2022-04-05 00:09:06,679 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-05 00:09:06,679 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 00:09:06,726 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 00:09:06,733 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-05 00:09:06,734 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 00:09:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 00:09:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-05 00:09:06,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:06,772 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:09:06,772 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:06,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1407118819, now seen corresponding path program 1 times [2022-04-05 00:09:06,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:06,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771410832] [2022-04-05 00:09:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:09:07,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:07,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771410832] [2022-04-05 00:09:07,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771410832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:07,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:07,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 00:09:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442383961] [2022-04-05 00:09:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:07,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 00:09:07,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:07,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 00:09:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 00:09:07,377 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:09,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:09,865 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2022-04-05 00:09:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 00:09:09,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 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 30 [2022-04-05 00:09:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:09,877 INFO L225 Difference]: With dead ends: 258 [2022-04-05 00:09:09,878 INFO L226 Difference]: Without dead ends: 223 [2022-04-05 00:09:09,878 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 00:09:09,881 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 179 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:09,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 419 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:09:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-04-05 00:09:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-04-05 00:09:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.481651376146789) internal successors, (323), 218 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2022-04-05 00:09:09,951 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2022-04-05 00:09:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:09,952 INFO L478 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2022-04-05 00:09:09,952 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2022-04-05 00:09:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-05 00:09:09,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:09,954 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:09:09,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 00:09:09,954 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash -455653265, now seen corresponding path program 1 times [2022-04-05 00:09:09,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:09,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267356813] [2022-04-05 00:09:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:09,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:10,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 00:09:10,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:10,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267356813] [2022-04-05 00:09:10,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267356813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:10,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:10,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 00:09:10,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142941076] [2022-04-05 00:09:10,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:10,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 00:09:10,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:10,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 00:09:10,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 00:09:10,114 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:12,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:12,579 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2022-04-05 00:09:12,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 00:09:12,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 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 45 [2022-04-05 00:09:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:12,581 INFO L225 Difference]: With dead ends: 325 [2022-04-05 00:09:12,582 INFO L226 Difference]: Without dead ends: 325 [2022-04-05 00:09:12,582 INFO L912 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-04-05 00:09:12,583 INFO L913 BasicCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:12,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:09:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-05 00:09:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-04-05 00:09:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2022-04-05 00:09:12,609 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2022-04-05 00:09:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:12,609 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2022-04-05 00:09:12,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-05 00:09:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-05 00:09:12,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:12,611 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-05 00:09:12,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 00:09:12,612 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash 702475222, now seen corresponding path program 1 times [2022-04-05 00:09:12,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:12,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715159576] [2022-04-05 00:09:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:12,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 00:09:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:12,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715159576] [2022-04-05 00:09:12,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715159576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:12,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:12,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:12,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294266316] [2022-04-05 00:09:12,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:12,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:12,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:12,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:12,766 INFO L87 Difference]: Start difference. First operand 325 states and 476 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-04-05 00:09:16,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:17,651 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-04-05 00:09:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:18,171 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2022-04-05 00:09:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:18,171 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 63 [2022-04-05 00:09:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:18,173 INFO L225 Difference]: With dead ends: 513 [2022-04-05 00:09:18,173 INFO L226 Difference]: Without dead ends: 513 [2022-04-05 00:09:18,174 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:18,174 INFO L913 BasicCegarLoop]: 245 mSDtfsCounter, 98 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:18,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 582 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 555 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-05 00:09:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-04-05 00:09:18,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2022-04-05 00:09:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.508108108108108) internal successors, (558), 370 states have internal predecessors, (558), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2022-04-05 00:09:18,185 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2022-04-05 00:09:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:18,186 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2022-04-05 00:09:18,186 INFO L479 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-04-05 00:09:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2022-04-05 00:09:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-05 00:09:18,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:18,204 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-05 00:09:18,204 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 00:09:18,205 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:18,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:18,205 INFO L85 PathProgramCache]: Analyzing trace with hash 635468469, now seen corresponding path program 1 times [2022-04-05 00:09:18,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:18,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889201894] [2022-04-05 00:09:18,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:18,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:18,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 00:09:18,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:18,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889201894] [2022-04-05 00:09:18,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889201894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:18,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:18,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134839038] [2022-04-05 00:09:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:18,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:18,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:18,377 INFO L87 Difference]: Start difference. First operand 375 states and 562 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-04-05 00:09:20,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:20,787 INFO L93 Difference]: Finished difference Result 650 states and 970 transitions. [2022-04-05 00:09:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:20,787 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 63 [2022-04-05 00:09:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:20,789 INFO L225 Difference]: With dead ends: 650 [2022-04-05 00:09:20,790 INFO L226 Difference]: Without dead ends: 650 [2022-04-05 00:09:20,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:20,790 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:20,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 285 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:09:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-05 00:09:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 397. [2022-04-05 00:09:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 392 states have (on average 1.5255102040816326) internal successors, (598), 392 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 602 transitions. [2022-04-05 00:09:20,804 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 602 transitions. Word has length 63 [2022-04-05 00:09:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:20,805 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 602 transitions. [2022-04-05 00:09:20,805 INFO L479 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-04-05 00:09:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 602 transitions. [2022-04-05 00:09:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-05 00:09:20,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:20,807 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-05 00:09:20,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 00:09:20,808 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash 302842584, now seen corresponding path program 1 times [2022-04-05 00:09:20,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:20,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383382918] [2022-04-05 00:09:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:20,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 00:09:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:20,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383382918] [2022-04-05 00:09:20,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383382918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:20,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:20,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:20,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032183462] [2022-04-05 00:09:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:20,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:20,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:20,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:20,977 INFO L87 Difference]: Start difference. First operand 397 states and 602 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-04-05 00:09:23,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:25,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:28,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:28,414 INFO L93 Difference]: Finished difference Result 672 states and 1010 transitions. [2022-04-05 00:09:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:28,415 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 64 [2022-04-05 00:09:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:28,417 INFO L225 Difference]: With dead ends: 672 [2022-04-05 00:09:28,417 INFO L226 Difference]: Without dead ends: 672 [2022-04-05 00:09:28,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:28,418 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 108 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:28,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 284 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 385 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-04-05 00:09:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-04-05 00:09:28,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 472. [2022-04-05 00:09:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 467 states have (on average 1.563169164882227) internal successors, (730), 467 states have internal predecessors, (730), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 734 transitions. [2022-04-05 00:09:28,427 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 734 transitions. Word has length 64 [2022-04-05 00:09:28,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:28,427 INFO L478 AbstractCegarLoop]: Abstraction has 472 states and 734 transitions. [2022-04-05 00:09:28,428 INFO L479 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-04-05 00:09:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 734 transitions. [2022-04-05 00:09:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-05 00:09:28,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:28,429 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-05 00:09:28,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-05 00:09:28,429 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 799385778, now seen corresponding path program 1 times [2022-04-05 00:09:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:28,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824441491] [2022-04-05 00:09:28,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:28,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 00:09:28,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:28,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824441491] [2022-04-05 00:09:28,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824441491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:28,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:28,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:28,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915512323] [2022-04-05 00:09:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:28,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:28,586 INFO L87 Difference]: Start difference. First operand 472 states and 734 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-04-05 00:09:30,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:31,109 INFO L93 Difference]: Finished difference Result 654 states and 1002 transitions. [2022-04-05 00:09:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:31,109 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 65 [2022-04-05 00:09:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:31,111 INFO L225 Difference]: With dead ends: 654 [2022-04-05 00:09:31,111 INFO L226 Difference]: Without dead ends: 654 [2022-04-05 00:09:31,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:31,112 INFO L913 BasicCegarLoop]: 241 mSDtfsCounter, 91 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:31,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 574 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 544 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-05 00:09:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-04-05 00:09:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 526. [2022-04-05 00:09:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 521 states have (on average 1.5738963531669865) internal successors, (820), 521 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 824 transitions. [2022-04-05 00:09:31,120 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 824 transitions. Word has length 65 [2022-04-05 00:09:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:31,121 INFO L478 AbstractCegarLoop]: Abstraction has 526 states and 824 transitions. [2022-04-05 00:09:31,121 INFO L479 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-04-05 00:09:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 824 transitions. [2022-04-05 00:09:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-05 00:09:31,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:31,122 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-05 00:09:31,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-05 00:09:31,122 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 830405585, now seen corresponding path program 1 times [2022-04-05 00:09:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:31,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143176549] [2022-04-05 00:09:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 00:09:31,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:31,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143176549] [2022-04-05 00:09:31,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143176549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:31,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:31,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440149592] [2022-04-05 00:09:31,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:31,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:31,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:31,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:31,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:31,229 INFO L87 Difference]: Start difference. First operand 526 states and 824 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-04-05 00:09:33,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:33,592 INFO L93 Difference]: Finished difference Result 801 states and 1226 transitions. [2022-04-05 00:09:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:33,593 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 65 [2022-04-05 00:09:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:33,596 INFO L225 Difference]: With dead ends: 801 [2022-04-05 00:09:33,596 INFO L226 Difference]: Without dead ends: 801 [2022-04-05 00:09:33,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:33,596 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 106 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:33,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 284 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-05 00:09:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-04-05 00:09:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 550. [2022-04-05 00:09:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.581651376146789) internal successors, (862), 545 states have internal predecessors, (862), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 866 transitions. [2022-04-05 00:09:33,606 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 866 transitions. Word has length 65 [2022-04-05 00:09:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:33,607 INFO L478 AbstractCegarLoop]: Abstraction has 550 states and 866 transitions. [2022-04-05 00:09:33,610 INFO L479 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-04-05 00:09:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 866 transitions. [2022-04-05 00:09:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-05 00:09:33,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:33,612 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-05 00:09:33,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-05 00:09:33,612 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -987893291, now seen corresponding path program 1 times [2022-04-05 00:09:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162404190] [2022-04-05 00:09:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 00:09:33,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:33,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162404190] [2022-04-05 00:09:33,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162404190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:33,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:33,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:33,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881643857] [2022-04-05 00:09:33,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:33,733 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:33,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:33,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:33,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:33,734 INFO L87 Difference]: Start difference. First operand 550 states and 866 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-04-05 00:09:35,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:37,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:39,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:41,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:42,060 INFO L93 Difference]: Finished difference Result 722 states and 1120 transitions. [2022-04-05 00:09:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:42,060 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 66 [2022-04-05 00:09:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:42,063 INFO L225 Difference]: With dead ends: 722 [2022-04-05 00:09:42,063 INFO L226 Difference]: Without dead ends: 722 [2022-04-05 00:09:42,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:42,063 INFO L913 BasicCegarLoop]: 236 mSDtfsCounter, 84 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:42,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 564 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 529 Invalid, 3 Unknown, 0 Unchecked, 8.3s Time] [2022-04-05 00:09:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-04-05 00:09:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 606. [2022-04-05 00:09:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.5873544093178036) internal successors, (954), 601 states have internal predecessors, (954), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 958 transitions. [2022-04-05 00:09:42,073 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 958 transitions. Word has length 66 [2022-04-05 00:09:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:42,073 INFO L478 AbstractCegarLoop]: Abstraction has 606 states and 958 transitions. [2022-04-05 00:09:42,073 INFO L479 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-04-05 00:09:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 958 transitions. [2022-04-05 00:09:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-05 00:09:42,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:42,074 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-05 00:09:42,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-05 00:09:42,075 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash -26279274, now seen corresponding path program 1 times [2022-04-05 00:09:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:42,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264879472] [2022-04-05 00:09:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:42,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:42,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 00:09:42,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:42,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264879472] [2022-04-05 00:09:42,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264879472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:42,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:42,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050971195] [2022-04-05 00:09:42,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:42,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:42,203 INFO L87 Difference]: Start difference. First operand 606 states and 958 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-04-05 00:09:44,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:44,586 INFO L93 Difference]: Finished difference Result 806 states and 1231 transitions. [2022-04-05 00:09:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:44,586 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 66 [2022-04-05 00:09:44,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:44,588 INFO L225 Difference]: With dead ends: 806 [2022-04-05 00:09:44,588 INFO L226 Difference]: Without dead ends: 806 [2022-04-05 00:09:44,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:44,589 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 105 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:44,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:09:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-04-05 00:09:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 556. [2022-04-05 00:09:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.5807622504537204) internal successors, (871), 551 states have internal predecessors, (871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 875 transitions. [2022-04-05 00:09:44,599 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 875 transitions. Word has length 66 [2022-04-05 00:09:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:44,599 INFO L478 AbstractCegarLoop]: Abstraction has 556 states and 875 transitions. [2022-04-05 00:09:44,599 INFO L479 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-04-05 00:09:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 875 transitions. [2022-04-05 00:09:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-05 00:09:44,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:44,601 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-04-05 00:09:44,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-05 00:09:44,601 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1677857873, now seen corresponding path program 1 times [2022-04-05 00:09:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:44,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254884185] [2022-04-05 00:09:44,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 00:09:44,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254884185] [2022-04-05 00:09:44,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254884185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:44,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:44,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801280606] [2022-04-05 00:09:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:44,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:44,728 INFO L87 Difference]: Start difference. First operand 556 states and 875 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-04-05 00:09:46,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-04-05 00:09:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:47,192 INFO L93 Difference]: Finished difference Result 728 states and 1127 transitions. [2022-04-05 00:09:47,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:47,192 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 84 [2022-04-05 00:09:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:47,194 INFO L225 Difference]: With dead ends: 728 [2022-04-05 00:09:47,194 INFO L226 Difference]: Without dead ends: 728 [2022-04-05 00:09:47,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:47,195 INFO L913 BasicCegarLoop]: 236 mSDtfsCounter, 88 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:47,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 564 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:09:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-04-05 00:09:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 602. [2022-04-05 00:09:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 597 states have (on average 1.5896147403685092) internal successors, (949), 597 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 953 transitions. [2022-04-05 00:09:47,206 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 953 transitions. Word has length 84 [2022-04-05 00:09:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:47,206 INFO L478 AbstractCegarLoop]: Abstraction has 602 states and 953 transitions. [2022-04-05 00:09:47,207 INFO L479 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-04-05 00:09:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 953 transitions. [2022-04-05 00:09:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-05 00:09:47,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:47,208 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-04-05 00:09:47,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-05 00:09:47,208 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:47,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:47,209 INFO L85 PathProgramCache]: Analyzing trace with hash 916368944, now seen corresponding path program 1 times [2022-04-05 00:09:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:47,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206602504] [2022-04-05 00:09:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:47,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-05 00:09:47,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:47,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206602504] [2022-04-05 00:09:47,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206602504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:47,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:47,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982206222] [2022-04-05 00:09:47,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:47,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:47,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:47,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:47,325 INFO L87 Difference]: Start difference. First operand 602 states and 953 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:09:49,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:49,691 INFO L93 Difference]: Finished difference Result 686 states and 1076 transitions. [2022-04-05 00:09:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 84 [2022-04-05 00:09:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:49,693 INFO L225 Difference]: With dead ends: 686 [2022-04-05 00:09:49,693 INFO L226 Difference]: Without dead ends: 686 [2022-04-05 00:09:49,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:49,694 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 38 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:49,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 510 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-05 00:09:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-04-05 00:09:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 642. [2022-04-05 00:09:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 637 states have (on average 1.596546310832025) internal successors, (1017), 637 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1021 transitions. [2022-04-05 00:09:49,715 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1021 transitions. Word has length 84 [2022-04-05 00:09:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:49,715 INFO L478 AbstractCegarLoop]: Abstraction has 642 states and 1021 transitions. [2022-04-05 00:09:49,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:09:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1021 transitions. [2022-04-05 00:09:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-05 00:09:49,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:49,717 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-04-05 00:09:49,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-05 00:09:49,717 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:49,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1729995796, now seen corresponding path program 1 times [2022-04-05 00:09:49,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:49,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571853483] [2022-04-05 00:09:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:49,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:49,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 00:09:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:49,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571853483] [2022-04-05 00:09:49,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571853483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:49,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:49,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:49,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12271762] [2022-04-05 00:09:49,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:49,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:49,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:49,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:49,829 INFO L87 Difference]: Start difference. First operand 642 states and 1021 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-04-05 00:09:51,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:09:52,286 INFO L93 Difference]: Finished difference Result 762 states and 1186 transitions. [2022-04-05 00:09:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:09:52,286 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 85 [2022-04-05 00:09:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:09:52,288 INFO L225 Difference]: With dead ends: 762 [2022-04-05 00:09:52,289 INFO L226 Difference]: Without dead ends: 762 [2022-04-05 00:09:52,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:09:52,289 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 83 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:09:52,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 556 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 520 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:09:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-04-05 00:09:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 644. [2022-04-05 00:09:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.594679186228482) internal successors, (1019), 639 states have internal predecessors, (1019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:09:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1023 transitions. [2022-04-05 00:09:52,299 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1023 transitions. Word has length 85 [2022-04-05 00:09:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:09:52,299 INFO L478 AbstractCegarLoop]: Abstraction has 644 states and 1023 transitions. [2022-04-05 00:09:52,299 INFO L479 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-04-05 00:09:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1023 transitions. [2022-04-05 00:09:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-05 00:09:52,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:09:52,301 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:09:52,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-05 00:09:52,301 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:09:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:09:52,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1439972783, now seen corresponding path program 1 times [2022-04-05 00:09:52,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:09:52,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612772652] [2022-04-05 00:09:52,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:09:52,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:09:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:52,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:09:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:09:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-05 00:09:52,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:09:52,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612772652] [2022-04-05 00:09:52,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612772652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:09:52,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:09:52,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:09:52,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925870843] [2022-04-05 00:09:52,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:09:52,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:09:52,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:09:52,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:09:52,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:09:52,418 INFO L87 Difference]: Start difference. First operand 644 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:09:53,853 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-04-05 00:09:55,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:57,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:09:59,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:00,299 INFO L93 Difference]: Finished difference Result 760 states and 1182 transitions. [2022-04-05 00:10:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:00,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 99 [2022-04-05 00:10:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:00,302 INFO L225 Difference]: With dead ends: 760 [2022-04-05 00:10:00,302 INFO L226 Difference]: Without dead ends: 760 [2022-04-05 00:10:00,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:00,302 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 94 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:00,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 554 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 517 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-04-05 00:10:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-05 00:10:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 644. [2022-04-05 00:10:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.591549295774648) internal successors, (1017), 639 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1021 transitions. [2022-04-05 00:10:00,311 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1021 transitions. Word has length 99 [2022-04-05 00:10:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:00,312 INFO L478 AbstractCegarLoop]: Abstraction has 644 states and 1021 transitions. [2022-04-05 00:10:00,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:10:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1021 transitions. [2022-04-05 00:10:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-05 00:10:00,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:00,313 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:10:00,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-05 00:10:00,313 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:00,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash 283609487, now seen corresponding path program 1 times [2022-04-05 00:10:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:00,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300468906] [2022-04-05 00:10:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:00,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-05 00:10:00,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:00,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300468906] [2022-04-05 00:10:00,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300468906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:00,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:00,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:10:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171843736] [2022-04-05 00:10:00,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:00,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:10:00,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:00,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:10:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:10:00,427 INFO L87 Difference]: Start difference. First operand 644 states and 1021 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:10:01,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:03,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:05,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:07,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:07,811 INFO L93 Difference]: Finished difference Result 838 states and 1272 transitions. [2022-04-05 00:10:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:07,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 99 [2022-04-05 00:10:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:07,814 INFO L225 Difference]: With dead ends: 838 [2022-04-05 00:10:07,814 INFO L226 Difference]: Without dead ends: 838 [2022-04-05 00:10:07,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:07,814 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 119 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:07,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 298 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 392 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-04-05 00:10:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-04-05 00:10:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 644. [2022-04-05 00:10:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.5712050078247262) internal successors, (1004), 639 states have internal predecessors, (1004), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1008 transitions. [2022-04-05 00:10:07,823 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1008 transitions. Word has length 99 [2022-04-05 00:10:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:07,823 INFO L478 AbstractCegarLoop]: Abstraction has 644 states and 1008 transitions. [2022-04-05 00:10:07,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:10:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1008 transitions. [2022-04-05 00:10:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-05 00:10:07,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:07,825 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-04-05 00:10:07,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-05 00:10:07,825 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1270327410, now seen corresponding path program 1 times [2022-04-05 00:10:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:07,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251835039] [2022-04-05 00:10:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-05 00:10:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:07,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251835039] [2022-04-05 00:10:07,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251835039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:07,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:07,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:10:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594972547] [2022-04-05 00:10:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:07,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:10:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:07,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:10:07,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:10:07,950 INFO L87 Difference]: Start difference. First operand 644 states and 1008 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:10:09,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:10,291 INFO L93 Difference]: Finished difference Result 919 states and 1391 transitions. [2022-04-05 00:10:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 99 [2022-04-05 00:10:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:10,293 INFO L225 Difference]: With dead ends: 919 [2022-04-05 00:10:10,293 INFO L226 Difference]: Without dead ends: 919 [2022-04-05 00:10:10,294 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:10,294 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 114 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:10,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 326 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 406 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-05 00:10:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-04-05 00:10:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 692. [2022-04-05 00:10:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 687 states have (on average 1.5560407569141192) internal successors, (1069), 687 states have internal predecessors, (1069), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1073 transitions. [2022-04-05 00:10:10,305 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1073 transitions. Word has length 99 [2022-04-05 00:10:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:10,305 INFO L478 AbstractCegarLoop]: Abstraction has 692 states and 1073 transitions. [2022-04-05 00:10:10,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:10:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1073 transitions. [2022-04-05 00:10:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-05 00:10:10,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:10,307 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:10:10,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-05 00:10:10,307 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1822658265, now seen corresponding path program 1 times [2022-04-05 00:10:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:10,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605694600] [2022-04-05 00:10:10,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:10,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-05 00:10:10,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:10,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605694600] [2022-04-05 00:10:10,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605694600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:10,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:10,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:10:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612301181] [2022-04-05 00:10:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:10,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:10:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:10:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:10:10,423 INFO L87 Difference]: Start difference. First operand 692 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:10:11,457 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-04-05 00:10:13,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:15,421 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-04-05 00:10:17,448 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-04-05 00:10:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:17,861 INFO L93 Difference]: Finished difference Result 902 states and 1350 transitions. [2022-04-05 00:10:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:17,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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 100 [2022-04-05 00:10:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:17,863 INFO L225 Difference]: With dead ends: 902 [2022-04-05 00:10:17,863 INFO L226 Difference]: Without dead ends: 902 [2022-04-05 00:10:17,864 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:17,864 INFO L913 BasicCegarLoop]: 207 mSDtfsCounter, 111 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:17,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 503 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 488 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-04-05 00:10:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2022-04-05 00:10:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 695. [2022-04-05 00:10:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 690 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-04-05 00:10:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1063 transitions. [2022-04-05 00:10:17,875 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1063 transitions. Word has length 100 [2022-04-05 00:10:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:17,875 INFO L478 AbstractCegarLoop]: Abstraction has 695 states and 1063 transitions. [2022-04-05 00:10:17,875 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 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-04-05 00:10:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1063 transitions. [2022-04-05 00:10:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-05 00:10:17,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:17,877 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:10:17,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-05 00:10:17,877 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:17,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1551159321, now seen corresponding path program 1 times [2022-04-05 00:10:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:17,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378645336] [2022-04-05 00:10:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:17,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:17,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-05 00:10:17,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:17,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378645336] [2022-04-05 00:10:17,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378645336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:17,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:17,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:10:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836303939] [2022-04-05 00:10:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:17,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:10:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:17,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:10:17,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:10:17,990 INFO L87 Difference]: Start difference. First operand 695 states and 1063 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-04-05 00:10:19,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:21,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-04-05 00:10:23,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:25,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:25,933 INFO L93 Difference]: Finished difference Result 887 states and 1309 transitions. [2022-04-05 00:10:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:25,934 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 101 [2022-04-05 00:10:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:25,936 INFO L225 Difference]: With dead ends: 887 [2022-04-05 00:10:25,936 INFO L226 Difference]: Without dead ends: 887 [2022-04-05 00:10:25,936 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:25,937 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 40 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:25,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 320 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 404 Invalid, 3 Unknown, 0 Unchecked, 7.9s Time] [2022-04-05 00:10:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-04-05 00:10:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 695. [2022-04-05 00:10:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.5115942028985507) internal successors, (1043), 690 states have internal predecessors, (1043), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1047 transitions. [2022-04-05 00:10:25,947 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1047 transitions. Word has length 101 [2022-04-05 00:10:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:25,947 INFO L478 AbstractCegarLoop]: Abstraction has 695 states and 1047 transitions. [2022-04-05 00:10:25,947 INFO L479 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-04-05 00:10:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1047 transitions. [2022-04-05 00:10:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-05 00:10:25,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:25,948 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-04-05 00:10:25,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-05 00:10:25,948 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1227946150, now seen corresponding path program 1 times [2022-04-05 00:10:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:25,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814422833] [2022-04-05 00:10:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:26,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-05 00:10:26,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:26,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814422833] [2022-04-05 00:10:26,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814422833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:26,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:26,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:10:26,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726383906] [2022-04-05 00:10:26,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:26,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:10:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:10:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:10:26,058 INFO L87 Difference]: Start difference. First operand 695 states and 1047 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-04-05 00:10:28,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:28,500 INFO L93 Difference]: Finished difference Result 805 states and 1199 transitions. [2022-04-05 00:10:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:28,501 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 101 [2022-04-05 00:10:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:28,503 INFO L225 Difference]: With dead ends: 805 [2022-04-05 00:10:28,503 INFO L226 Difference]: Without dead ends: 805 [2022-04-05 00:10:28,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:28,504 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 82 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:28,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 542 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 502 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:10:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-04-05 00:10:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 695. [2022-04-05 00:10:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.508695652173913) internal successors, (1041), 690 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1045 transitions. [2022-04-05 00:10:28,513 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1045 transitions. Word has length 101 [2022-04-05 00:10:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:28,513 INFO L478 AbstractCegarLoop]: Abstraction has 695 states and 1045 transitions. [2022-04-05 00:10:28,514 INFO L479 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-04-05 00:10:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1045 transitions. [2022-04-05 00:10:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-05 00:10:28,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:28,515 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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-04-05 00:10:28,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-05 00:10:28,515 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1888113643, now seen corresponding path program 1 times [2022-04-05 00:10:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:28,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881174613] [2022-04-05 00:10:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:28,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-05 00:10:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:28,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881174613] [2022-04-05 00:10:28,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881174613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:28,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:28,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:10:28,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289049604] [2022-04-05 00:10:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:28,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:10:28,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:28,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:10:28,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:10:28,622 INFO L87 Difference]: Start difference. First operand 695 states and 1045 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:30,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:31,079 INFO L93 Difference]: Finished difference Result 805 states and 1197 transitions. [2022-04-05 00:10:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:31,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 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 101 [2022-04-05 00:10:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:31,082 INFO L225 Difference]: With dead ends: 805 [2022-04-05 00:10:31,082 INFO L226 Difference]: Without dead ends: 805 [2022-04-05 00:10:31,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:31,083 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 62 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:31,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 540 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 501 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:10:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-04-05 00:10:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 721. [2022-04-05 00:10:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.5125698324022345) internal successors, (1083), 716 states have internal predecessors, (1083), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1087 transitions. [2022-04-05 00:10:31,110 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1087 transitions. Word has length 101 [2022-04-05 00:10:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:31,111 INFO L478 AbstractCegarLoop]: Abstraction has 721 states and 1087 transitions. [2022-04-05 00:10:31,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1087 transitions. [2022-04-05 00:10:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-05 00:10:31,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:31,112 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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-04-05 00:10:31,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-05 00:10:31,112 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1753710164, now seen corresponding path program 1 times [2022-04-05 00:10:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:31,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787889693] [2022-04-05 00:10:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-05 00:10:31,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:31,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787889693] [2022-04-05 00:10:31,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787889693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:31,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:31,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:10:31,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354614139] [2022-04-05 00:10:31,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:31,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:10:31,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:31,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:10:31,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:10:31,213 INFO L87 Difference]: Start difference. First operand 721 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:33,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:33,570 INFO L93 Difference]: Finished difference Result 913 states and 1346 transitions. [2022-04-05 00:10:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:33,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 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 101 [2022-04-05 00:10:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:33,573 INFO L225 Difference]: With dead ends: 913 [2022-04-05 00:10:33,573 INFO L226 Difference]: Without dead ends: 913 [2022-04-05 00:10:33,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:33,574 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 91 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:33,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-05 00:10:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2022-04-05 00:10:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 754. [2022-04-05 00:10:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 749 states have (on average 1.5300400534045393) internal successors, (1146), 749 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1150 transitions. [2022-04-05 00:10:33,582 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1150 transitions. Word has length 101 [2022-04-05 00:10:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:33,582 INFO L478 AbstractCegarLoop]: Abstraction has 754 states and 1150 transitions. [2022-04-05 00:10:33,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1150 transitions. [2022-04-05 00:10:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-05 00:10:33,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:33,584 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-04-05 00:10:33,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-05 00:10:33,584 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash 61249831, now seen corresponding path program 1 times [2022-04-05 00:10:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:33,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107292191] [2022-04-05 00:10:33,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-05 00:10:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:33,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107292191] [2022-04-05 00:10:33,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107292191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:33,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:33,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:10:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242713817] [2022-04-05 00:10:33,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:33,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:10:33,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:33,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:10:33,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:10:33,679 INFO L87 Difference]: Start difference. First operand 754 states and 1150 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-04-05 00:10:35,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:36,067 INFO L93 Difference]: Finished difference Result 971 states and 1443 transitions. [2022-04-05 00:10:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:36,068 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 101 [2022-04-05 00:10:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:36,070 INFO L225 Difference]: With dead ends: 971 [2022-04-05 00:10:36,070 INFO L226 Difference]: Without dead ends: 971 [2022-04-05 00:10:36,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:36,071 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 108 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:36,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 330 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 402 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:10:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-05 00:10:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 757. [2022-04-05 00:10:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 752 states have (on average 1.5172872340425532) internal successors, (1141), 752 states have internal predecessors, (1141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1145 transitions. [2022-04-05 00:10:36,079 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1145 transitions. Word has length 101 [2022-04-05 00:10:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:36,080 INFO L478 AbstractCegarLoop]: Abstraction has 757 states and 1145 transitions. [2022-04-05 00:10:36,080 INFO L479 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-04-05 00:10:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1145 transitions. [2022-04-05 00:10:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-05 00:10:36,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:36,081 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:10:36,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-05 00:10:36,081 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash -5355367, now seen corresponding path program 1 times [2022-04-05 00:10:36,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:36,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648419014] [2022-04-05 00:10:36,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:36,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:36,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-05 00:10:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:36,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648419014] [2022-04-05 00:10:36,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648419014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:36,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:36,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 00:10:36,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968960254] [2022-04-05 00:10:36,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:36,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 00:10:36,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:36,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 00:10:36,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 00:10:36,207 INFO L87 Difference]: Start difference. First operand 757 states and 1145 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:38,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:38,574 INFO L93 Difference]: Finished difference Result 1023 states and 1547 transitions. [2022-04-05 00:10:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 00:10:38,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 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 116 [2022-04-05 00:10:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:38,579 INFO L225 Difference]: With dead ends: 1023 [2022-04-05 00:10:38,579 INFO L226 Difference]: Without dead ends: 1023 [2022-04-05 00:10:38,579 INFO L912 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-04-05 00:10:38,580 INFO L913 BasicCegarLoop]: 319 mSDtfsCounter, 121 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:38,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:10:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-04-05 00:10:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2022-04-05 00:10:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.5157170923379175) internal successors, (1543), 1018 states have internal predecessors, (1543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1547 transitions. [2022-04-05 00:10:38,596 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1547 transitions. Word has length 116 [2022-04-05 00:10:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:38,597 INFO L478 AbstractCegarLoop]: Abstraction has 1023 states and 1547 transitions. [2022-04-05 00:10:38,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1547 transitions. [2022-04-05 00:10:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-05 00:10:38,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:38,599 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-04-05 00:10:38,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-05 00:10:38,600 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash 951047844, now seen corresponding path program 1 times [2022-04-05 00:10:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:38,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646685841] [2022-04-05 00:10:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:38,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-05 00:10:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:38,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646685841] [2022-04-05 00:10:38,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646685841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:38,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:38,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 00:10:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430735883] [2022-04-05 00:10:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:38,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 00:10:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:38,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 00:10:38,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 00:10:38,736 INFO L87 Difference]: Start difference. First operand 1023 states and 1547 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:40,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:41,082 INFO L93 Difference]: Finished difference Result 1289 states and 1947 transitions. [2022-04-05 00:10:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 00:10:41,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-05 00:10:41,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:41,086 INFO L225 Difference]: With dead ends: 1289 [2022-04-05 00:10:41,086 INFO L226 Difference]: Without dead ends: 1289 [2022-04-05 00:10:41,086 INFO L912 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-04-05 00:10:41,087 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:41,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-05 00:10:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-04-05 00:10:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1287. [2022-04-05 00:10:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1282 states have (on average 1.5148205928237128) internal successors, (1942), 1282 states have internal predecessors, (1942), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1946 transitions. [2022-04-05 00:10:41,098 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1946 transitions. Word has length 119 [2022-04-05 00:10:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:41,099 INFO L478 AbstractCegarLoop]: Abstraction has 1287 states and 1946 transitions. [2022-04-05 00:10:41,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1946 transitions. [2022-04-05 00:10:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-05 00:10:41,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:41,101 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-04-05 00:10:41,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-05 00:10:41,101 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:41,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1126161499, now seen corresponding path program 1 times [2022-04-05 00:10:41,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:41,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895358133] [2022-04-05 00:10:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:41,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-05 00:10:41,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:41,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895358133] [2022-04-05 00:10:41,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895358133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:41,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:41,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 00:10:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11643111] [2022-04-05 00:10:41,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:41,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 00:10:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 00:10:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 00:10:41,269 INFO L87 Difference]: Start difference. First operand 1287 states and 1946 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:43,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:43,636 INFO L93 Difference]: Finished difference Result 1261 states and 1900 transitions. [2022-04-05 00:10:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 00:10:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 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 119 [2022-04-05 00:10:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:43,640 INFO L225 Difference]: With dead ends: 1261 [2022-04-05 00:10:43,640 INFO L226 Difference]: Without dead ends: 1261 [2022-04-05 00:10:43,640 INFO L912 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-04-05 00:10:43,641 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:43,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 481 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:10:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-04-05 00:10:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1261. [2022-04-05 00:10:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1256 states have (on average 1.5095541401273886) internal successors, (1896), 1256 states have internal predecessors, (1896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1900 transitions. [2022-04-05 00:10:43,655 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1900 transitions. Word has length 119 [2022-04-05 00:10:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:43,655 INFO L478 AbstractCegarLoop]: Abstraction has 1261 states and 1900 transitions. [2022-04-05 00:10:43,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1900 transitions. [2022-04-05 00:10:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-05 00:10:43,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:43,658 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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] [2022-04-05 00:10:43,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-05 00:10:43,658 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash 530083479, now seen corresponding path program 1 times [2022-04-05 00:10:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:43,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668210310] [2022-04-05 00:10:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:43,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 00:10:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 00:10:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-05 00:10:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 00:10:43,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668210310] [2022-04-05 00:10:43,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668210310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 00:10:43,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 00:10:43,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 00:10:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311874959] [2022-04-05 00:10:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 00:10:43,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 00:10:43,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 00:10:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 00:10:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 00:10:43,800 INFO L87 Difference]: Start difference. First operand 1261 states and 1900 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:45,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-05 00:10:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 00:10:46,185 INFO L93 Difference]: Finished difference Result 1519 states and 2192 transitions. [2022-04-05 00:10:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 00:10:46,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 143 [2022-04-05 00:10:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 00:10:46,189 INFO L225 Difference]: With dead ends: 1519 [2022-04-05 00:10:46,190 INFO L226 Difference]: Without dead ends: 1519 [2022-04-05 00:10:46,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 00:10:46,190 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 107 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-05 00:10:46,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 295 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-05 00:10:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-04-05 00:10:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1261. [2022-04-05 00:10:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1256 states have (on average 1.4952229299363058) internal successors, (1878), 1256 states have internal predecessors, (1878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1882 transitions. [2022-04-05 00:10:46,207 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1882 transitions. Word has length 143 [2022-04-05 00:10:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 00:10:46,207 INFO L478 AbstractCegarLoop]: Abstraction has 1261 states and 1882 transitions. [2022-04-05 00:10:46,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 00:10:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1882 transitions. [2022-04-05 00:10:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-05 00:10:46,209 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 00:10:46,210 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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] [2022-04-05 00:10:46,210 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-05 00:10:46,210 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 00:10:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 00:10:46,210 INFO L85 PathProgramCache]: Analyzing trace with hash 144716696, now seen corresponding path program 1 times [2022-04-05 00:10:46,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 00:10:46,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180997187] [2022-04-05 00:10:46,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 00:10:46,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 00:10:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-05 00:10:47,387 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-05 00:10:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-05 00:10:47,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-05 00:10:47,709 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-05 00:10:47,709 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 00:10:47,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-05 00:10:47,713 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 00:10:47,715 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 00:10:47,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 12:10:47 BasicIcfg [2022-04-05 00:10:47,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 00:10:47,825 INFO L158 Benchmark]: Toolchain (without parser) took 103103.24ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 139.3MB in the beginning and 174.9MB in the end (delta: -35.6MB). Peak memory consumption was 132.3MB. Max. memory is 8.0GB. [2022-04-05 00:10:47,825 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory was 157.5MB in the beginning and 157.4MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 00:10:47,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.87ms. Allocated memory is still 190.8MB. Free memory was 139.1MB in the beginning and 148.3MB in the end (delta: -9.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-04-05 00:10:47,825 INFO L158 Benchmark]: Boogie Preprocessor took 111.91ms. Allocated memory is still 190.8MB. Free memory was 148.3MB in the beginning and 141.5MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-04-05 00:10:47,825 INFO L158 Benchmark]: RCFGBuilder took 1351.52ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 141.4MB in the beginning and 159.8MB in the end (delta: -18.4MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. [2022-04-05 00:10:47,826 INFO L158 Benchmark]: IcfgTransformer took 53.57ms. Allocated memory is still 229.6MB. Free memory was 159.8MB in the beginning and 155.0MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-04-05 00:10:47,826 INFO L158 Benchmark]: TraceAbstraction took 101158.11ms. Allocated memory is still 229.6MB. Free memory was 154.5MB in the beginning and 174.9MB in the end (delta: -20.4MB). Peak memory consumption was 107.9MB. Max. memory is 8.0GB. [2022-04-05 00:10:47,826 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory was 157.5MB in the beginning and 157.4MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.87ms. Allocated memory is still 190.8MB. Free memory was 139.1MB in the beginning and 148.3MB in the end (delta: -9.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 111.91ms. Allocated memory is still 190.8MB. Free memory was 148.3MB in the beginning and 141.5MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1351.52ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 141.4MB in the beginning and 159.8MB in the end (delta: -18.4MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. * IcfgTransformer took 53.57ms. Allocated memory is still 229.6MB. Free memory was 159.8MB in the beginning and 155.0MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 101158.11ms. Allocated memory is still 229.6MB. Free memory was 154.5MB in the beginning and 174.9MB in the end (delta: -20.4MB). Peak memory consumption was 107.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1658]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1343. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967304, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={4:0}] [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) VAL [init=1, s={-10:0}, SSLv3_client_data={4:0}] [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8] [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8] [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8] [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8] [L1262] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->version=7, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8] [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->init_buf={0:-6}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8] [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967327, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->s3={-14:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:15}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->bbio={0:18}, s->wbio={0:19}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967327, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->s3={-14:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:15}, init=1, ret=17, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1329] COND FALSE !(ret <= 0) [L1334] s->hit VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1339] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967327, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-14:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967335, (s->s3)->tmp.new_cipher={-9:0}, blastFlag=2, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-14:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1352] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1358] s->state = 4416 [L1359] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967327, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-14:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13] [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967327, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-14:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967327, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->s3={-14:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=-18, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] [L1658] reach_error() VAL [={0:-2147483648}, blastFlag=4, buf={0:15}, init=1, ret=-18, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-12:0}, tmp___1=1, tmp___2=8, tmp___4=11, tmp___5=-13, tmp___6=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 101.0s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 95.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 35 mSolverCounterUnknown, 2597 SdHoareTripleChecker+Valid, 94.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2597 mSDsluCounter, 10848 SdHoareTripleChecker+Invalid, 92.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6002 mSDsCounter, 573 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10600 IncrementalHoareTripleChecker+Invalid, 11208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 573 mSolverCounterUnsat, 4846 mSDtfsCounter, 10600 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1287occurred in iteration=23, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 3387 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2322 NumberOfCodeBlocks, 2322 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2154 ConstructedInterpolants, 0 QuantifiedInterpolants, 5913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 1925/1925 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-05 00:10:47,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...