/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.1-dev-6253b08 [2021-05-06 05:23:32,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 05:23:32,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 05:23:32,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 05:23:32,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 05:23:32,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 05:23:32,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 05:23:32,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 05:23:32,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 05:23:32,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 05:23:32,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 05:23:32,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 05:23:32,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 05:23:32,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 05:23:32,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 05:23:32,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 05:23:32,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 05:23:32,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 05:23:32,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 05:23:32,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 05:23:32,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 05:23:32,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 05:23:32,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 05:23:32,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 05:23:32,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 05:23:32,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 05:23:32,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 05:23:32,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 05:23:32,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 05:23:32,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 05:23:32,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 05:23:32,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 05:23:32,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 05:23:32,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 05:23:32,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 05:23:32,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 05:23:32,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 05:23:32,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 05:23:32,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 05:23:32,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 05:23:32,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 05:23:32,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-06 05:23:32,694 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 05:23:32,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 05:23:32,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 05:23:32,696 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 05:23:32,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 05:23:32,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 05:23:32,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 05:23:32,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 05:23:32,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 05:23:32,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 05:23:32,697 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 05:23:32,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 05:23:32,698 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 05:23:32,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 05:23:32,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 05:23:32,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 05:23:32,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 05:23:32,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 05:23:32,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 05:23:32,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 05:23:32,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-06 05:23:32,699 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-06 05:23:32,700 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; [2021-05-06 05:23:32,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 05:23:33,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 05:23:33,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 05:23:33,025 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 05:23:33,025 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 05:23:33,026 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2021-05-06 05:23:33,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8c5d3f6/b5278b1b6af2447b9b90765460369816/FLAG251aaef24 [2021-05-06 05:23:33,755 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 05:23:33,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2021-05-06 05:23:33,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8c5d3f6/b5278b1b6af2447b9b90765460369816/FLAG251aaef24 [2021-05-06 05:23:33,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8c5d3f6/b5278b1b6af2447b9b90765460369816 [2021-05-06 05:23:33,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 05:23:33,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-06 05:23:33,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 05:23:33,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 05:23:33,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 05:23:33,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:23:33" (1/1) ... [2021-05-06 05:23:33,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30787471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:33, skipping insertion in model container [2021-05-06 05:23:33,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:23:33" (1/1) ... [2021-05-06 05:23:33,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 05:23:33,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 05:23:34,158 WARN L224 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[63567,63580] [2021-05-06 05:23:34,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 05:23:34,183 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 05:23:34,259 WARN L224 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[63567,63580] [2021-05-06 05:23:34,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 05:23:34,279 INFO L208 MainTranslator]: Completed translation [2021-05-06 05:23:34,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34 WrapperNode [2021-05-06 05:23:34,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 05:23:34,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 05:23:34,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 05:23:34,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 05:23:34,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34" (1/1) ... [2021-05-06 05:23:34,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34" (1/1) ... [2021-05-06 05:23:34,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34" (1/1) ... [2021-05-06 05:23:34,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34" (1/1) ... [2021-05-06 05:23:34,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34" (1/1) ... [2021-05-06 05:23:34,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34" (1/1) ... [2021-05-06 05:23:34,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34" (1/1) ... [2021-05-06 05:23:34,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 05:23:34,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 05:23:34,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 05:23:34,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 05:23:34,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 05:23:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 05:23:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 05:23:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 05:23:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2021-05-06 05:23:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2021-05-06 05:23:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 05:23:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2021-05-06 05:23:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2021-05-06 05:23:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-05-06 05:23:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-05-06 05:23:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 05:23:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 05:23:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 05:23:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 05:23:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-05-06 05:23:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 05:23:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2021-05-06 05:23:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-05-06 05:23:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2021-05-06 05:23:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2021-05-06 05:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2021-05-06 05:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2021-05-06 05:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-05-06 05:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-06 05:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 05:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-06 05:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 05:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-05-06 05:23:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-05-06 05:23:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 05:23:34,779 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-05-06 05:23:35,166 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-05-06 05:23:35,166 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-05-06 05:23:35,194 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 05:23:35,194 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-06 05:23:35,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:23:35 BoogieIcfgContainer [2021-05-06 05:23:35,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 05:23:35,196 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-06 05:23:35,196 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-06 05:23:35,197 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-06 05:23:35,199 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:23:35" (1/1) ... [2021-05-06 05:23:35,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 05:23:35 BasicIcfg [2021-05-06 05:23:35,229 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-06 05:23:35,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 05:23:35,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 05:23:35,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 05:23:35,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 05:23:33" (1/4) ... [2021-05-06 05:23:35,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5705d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:23:35, skipping insertion in model container [2021-05-06 05:23:35,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:23:34" (2/4) ... [2021-05-06 05:23:35,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5705d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:23:35, skipping insertion in model container [2021-05-06 05:23:35,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:23:35" (3/4) ... [2021-05-06 05:23:35,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5705d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:23:35, skipping insertion in model container [2021-05-06 05:23:35,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 05:23:35" (4/4) ... [2021-05-06 05:23:35,236 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.iJordan [2021-05-06 05:23:35,240 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-06 05:23:35,243 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 05:23:35,254 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 05:23:35,273 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 05:23:35,273 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-06 05:23:35,274 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-06 05:23:35,274 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 05:23:35,274 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 05:23:35,274 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 05:23:35,274 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 05:23:35,274 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 05:23:35,289 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) [2021-05-06 05:23:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-06 05:23:35,296 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:35,297 INFO L523 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] [2021-05-06 05:23:35,297 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1407118819, now seen corresponding path program 1 times [2021-05-06 05:23:35,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:35,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75254747] [2021-05-06 05:23:35,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:35,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:23:35,563 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:35,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75254747] [2021-05-06 05:23:35,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75254747] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:35,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:35,564 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 05:23:35,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611474526] [2021-05-06 05:23:35,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 05:23:35,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 05:23:35,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:35,577 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) [2021-05-06 05:23:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:35,976 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2021-05-06 05:23:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 05:23:35,978 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 [2021-05-06 05:23:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:35,988 INFO L225 Difference]: With dead ends: 258 [2021-05-06 05:23:35,988 INFO L226 Difference]: Without dead ends: 223 [2021-05-06 05:23:35,989 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-05-06 05:23:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-05-06 05:23:36,032 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) [2021-05-06 05:23:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2021-05-06 05:23:36,035 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2021-05-06 05:23:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:36,036 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2021-05-06 05:23:36,036 INFO L481 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) [2021-05-06 05:23:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2021-05-06 05:23:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-06 05:23:36,037 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:36,038 INFO L523 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] [2021-05-06 05:23:36,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 05:23:36,038 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:36,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash -455653265, now seen corresponding path program 1 times [2021-05-06 05:23:36,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:36,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872831466] [2021-05-06 05:23:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:36,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:23:36,155 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:36,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872831466] [2021-05-06 05:23:36,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872831466] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:36,156 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:36,156 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 05:23:36,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411334101] [2021-05-06 05:23:36,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 05:23:36,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:36,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 05:23:36,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:36,157 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) [2021-05-06 05:23:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:36,649 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2021-05-06 05:23:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 05:23:36,650 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 [2021-05-06 05:23:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:36,651 INFO L225 Difference]: With dead ends: 325 [2021-05-06 05:23:36,652 INFO L226 Difference]: Without dead ends: 325 [2021-05-06 05:23:36,652 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-05-06 05:23:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-05-06 05:23:36,664 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) [2021-05-06 05:23:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2021-05-06 05:23:36,665 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2021-05-06 05:23:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:36,665 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2021-05-06 05:23:36,665 INFO L481 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) [2021-05-06 05:23:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2021-05-06 05:23:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-06 05:23:36,668 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:36,668 INFO L523 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] [2021-05-06 05:23:36,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 05:23:36,668 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:36,669 INFO L82 PathProgramCache]: Analyzing trace with hash 702475222, now seen corresponding path program 1 times [2021-05-06 05:23:36,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:36,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217603857] [2021-05-06 05:23:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:36,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:36,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:36,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217603857] [2021-05-06 05:23:36,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217603857] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:36,776 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:36,776 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:36,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2931071] [2021-05-06 05:23:36,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:36,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:36,778 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) [2021-05-06 05:23:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:37,452 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2021-05-06 05:23:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:37,453 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 [2021-05-06 05:23:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:37,456 INFO L225 Difference]: With dead ends: 513 [2021-05-06 05:23:37,456 INFO L226 Difference]: Without dead ends: 513 [2021-05-06 05:23:37,456 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-05-06 05:23:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2021-05-06 05:23:37,467 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) [2021-05-06 05:23:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2021-05-06 05:23:37,469 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2021-05-06 05:23:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:37,469 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2021-05-06 05:23:37,469 INFO L481 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) [2021-05-06 05:23:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2021-05-06 05:23:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-06 05:23:37,478 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:37,479 INFO L523 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] [2021-05-06 05:23:37,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 05:23:37,479 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash 635468469, now seen corresponding path program 1 times [2021-05-06 05:23:37,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:37,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096532188] [2021-05-06 05:23:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:37,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:37,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:37,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096532188] [2021-05-06 05:23:37,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096532188] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:37,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:37,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:37,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380990618] [2021-05-06 05:23:37,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:37,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:37,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:37,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:37,568 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) [2021-05-06 05:23:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:38,021 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2021-05-06 05:23:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:38,024 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 [2021-05-06 05:23:38,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:38,026 INFO L225 Difference]: With dead ends: 459 [2021-05-06 05:23:38,026 INFO L226 Difference]: Without dead ends: 459 [2021-05-06 05:23:38,027 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-05-06 05:23:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2021-05-06 05:23:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.526829268292683) internal successors, (626), 410 states have internal predecessors, (626), 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) [2021-05-06 05:23:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2021-05-06 05:23:38,036 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2021-05-06 05:23:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:38,036 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2021-05-06 05:23:38,036 INFO L481 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) [2021-05-06 05:23:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2021-05-06 05:23:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-06 05:23:38,037 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:38,038 INFO L523 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] [2021-05-06 05:23:38,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 05:23:38,038 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:38,038 INFO L82 PathProgramCache]: Analyzing trace with hash 302842584, now seen corresponding path program 1 times [2021-05-06 05:23:38,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:38,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826151815] [2021-05-06 05:23:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:38,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:38,125 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:38,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826151815] [2021-05-06 05:23:38,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826151815] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:38,126 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:38,126 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:38,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446308004] [2021-05-06 05:23:38,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:38,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:38,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:38,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:38,127 INFO L87 Difference]: Start difference. First operand 415 states and 630 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) [2021-05-06 05:23:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:38,795 INFO L93 Difference]: Finished difference Result 547 states and 814 transitions. [2021-05-06 05:23:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:38,796 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 [2021-05-06 05:23:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:38,799 INFO L225 Difference]: With dead ends: 547 [2021-05-06 05:23:38,799 INFO L226 Difference]: Without dead ends: 547 [2021-05-06 05:23:38,799 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-05-06 05:23:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2021-05-06 05:23:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.5242718446601942) internal successors, (628), 412 states have internal predecessors, (628), 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) [2021-05-06 05:23:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2021-05-06 05:23:38,807 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2021-05-06 05:23:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:38,807 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2021-05-06 05:23:38,807 INFO L481 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) [2021-05-06 05:23:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2021-05-06 05:23:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-06 05:23:38,808 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:38,808 INFO L523 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] [2021-05-06 05:23:38,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 05:23:38,809 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash 799385778, now seen corresponding path program 1 times [2021-05-06 05:23:38,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:38,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583935624] [2021-05-06 05:23:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:38,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:38,908 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:38,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583935624] [2021-05-06 05:23:38,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583935624] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:38,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:38,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:38,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681266689] [2021-05-06 05:23:38,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:38,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:38,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:38,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:38,910 INFO L87 Difference]: Start difference. First operand 417 states and 632 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) [2021-05-06 05:23:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:39,535 INFO L93 Difference]: Finished difference Result 547 states and 812 transitions. [2021-05-06 05:23:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:39,536 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 [2021-05-06 05:23:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:39,537 INFO L225 Difference]: With dead ends: 547 [2021-05-06 05:23:39,538 INFO L226 Difference]: Without dead ends: 547 [2021-05-06 05:23:39,538 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-05-06 05:23:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2021-05-06 05:23:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.5217391304347827) internal successors, (630), 414 states have internal predecessors, (630), 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) [2021-05-06 05:23:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2021-05-06 05:23:39,545 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2021-05-06 05:23:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:39,546 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2021-05-06 05:23:39,546 INFO L481 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) [2021-05-06 05:23:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2021-05-06 05:23:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-06 05:23:39,547 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:39,547 INFO L523 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] [2021-05-06 05:23:39,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 05:23:39,547 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:39,547 INFO L82 PathProgramCache]: Analyzing trace with hash -987893291, now seen corresponding path program 1 times [2021-05-06 05:23:39,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:39,548 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68514523] [2021-05-06 05:23:39,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:39,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:39,652 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:39,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68514523] [2021-05-06 05:23:39,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68514523] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:39,653 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:39,653 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:39,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303467199] [2021-05-06 05:23:39,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:39,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:39,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:39,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:39,654 INFO L87 Difference]: Start difference. First operand 419 states and 634 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) [2021-05-06 05:23:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:40,216 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2021-05-06 05:23:40,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:40,217 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 [2021-05-06 05:23:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:40,218 INFO L225 Difference]: With dead ends: 537 [2021-05-06 05:23:40,218 INFO L226 Difference]: Without dead ends: 537 [2021-05-06 05:23:40,219 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-05-06 05:23:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2021-05-06 05:23:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5192307692307692) internal successors, (632), 416 states have internal predecessors, (632), 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) [2021-05-06 05:23:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2021-05-06 05:23:40,228 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2021-05-06 05:23:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:40,228 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2021-05-06 05:23:40,228 INFO L481 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) [2021-05-06 05:23:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2021-05-06 05:23:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-06 05:23:40,229 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:40,229 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:40,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 05:23:40,230 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:40,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash 712595926, now seen corresponding path program 1 times [2021-05-06 05:23:40,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:40,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974740159] [2021-05-06 05:23:40,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:40,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:40,331 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:40,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974740159] [2021-05-06 05:23:40,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974740159] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:40,332 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:40,332 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:40,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011860545] [2021-05-06 05:23:40,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:40,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:40,333 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:40,847 INFO L93 Difference]: Finished difference Result 535 states and 794 transitions. [2021-05-06 05:23:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-06 05:23:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:40,849 INFO L225 Difference]: With dead ends: 535 [2021-05-06 05:23:40,849 INFO L226 Difference]: Without dead ends: 535 [2021-05-06 05:23:40,850 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-06 05:23:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-06 05:23:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5144230769230769) internal successors, (630), 416 states have internal predecessors, (630), 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) [2021-05-06 05:23:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2021-05-06 05:23:40,857 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2021-05-06 05:23:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:40,857 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2021-05-06 05:23:40,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2021-05-06 05:23:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-06 05:23:40,858 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:40,858 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:40,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-06 05:23:40,858 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:40,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:40,859 INFO L82 PathProgramCache]: Analyzing trace with hash -946707978, now seen corresponding path program 1 times [2021-05-06 05:23:40,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:40,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371238860] [2021-05-06 05:23:40,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:40,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:40,932 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:40,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371238860] [2021-05-06 05:23:40,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371238860] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:40,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:40,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:40,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711271716] [2021-05-06 05:23:40,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:40,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:40,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:40,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:40,933 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:41,472 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2021-05-06 05:23:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:41,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-06 05:23:41,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:41,474 INFO L225 Difference]: With dead ends: 535 [2021-05-06 05:23:41,474 INFO L226 Difference]: Without dead ends: 535 [2021-05-06 05:23:41,474 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-06 05:23:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-06 05:23:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5096153846153846) internal successors, (628), 416 states have internal predecessors, (628), 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) [2021-05-06 05:23:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2021-05-06 05:23:41,481 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2021-05-06 05:23:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:41,481 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2021-05-06 05:23:41,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2021-05-06 05:23:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-06 05:23:41,482 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:41,482 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-06 05:23:41,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-06 05:23:41,483 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:41,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:41,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1054477673, now seen corresponding path program 1 times [2021-05-06 05:23:41,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:41,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777889148] [2021-05-06 05:23:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:41,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:41,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:41,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777889148] [2021-05-06 05:23:41,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777889148] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:41,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:41,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:41,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488202083] [2021-05-06 05:23:41,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:41,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:41,546 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:42,071 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2021-05-06 05:23:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-06 05:23:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:42,073 INFO L225 Difference]: With dead ends: 535 [2021-05-06 05:23:42,073 INFO L226 Difference]: Without dead ends: 535 [2021-05-06 05:23:42,073 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-06 05:23:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-06 05:23:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5048076923076923) internal successors, (626), 416 states have internal predecessors, (626), 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) [2021-05-06 05:23:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2021-05-06 05:23:42,080 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2021-05-06 05:23:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:42,080 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2021-05-06 05:23:42,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2021-05-06 05:23:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-06 05:23:42,081 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:42,081 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:42,081 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-06 05:23:42,081 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:42,082 INFO L82 PathProgramCache]: Analyzing trace with hash -210087657, now seen corresponding path program 1 times [2021-05-06 05:23:42,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:42,082 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697434244] [2021-05-06 05:23:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:42,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:42,166 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:42,166 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697434244] [2021-05-06 05:23:42,166 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697434244] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:42,166 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:42,166 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:42,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924991632] [2021-05-06 05:23:42,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:42,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:42,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:42,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:42,167 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:42,544 INFO L93 Difference]: Finished difference Result 463 states and 681 transitions. [2021-05-06 05:23:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:42,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-06 05:23:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:42,546 INFO L225 Difference]: With dead ends: 463 [2021-05-06 05:23:42,546 INFO L226 Difference]: Without dead ends: 463 [2021-05-06 05:23:42,546 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:42,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-06 05:23:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-06 05:23:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.5) internal successors, (624), 416 states have internal predecessors, (624), 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) [2021-05-06 05:23:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2021-05-06 05:23:42,552 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2021-05-06 05:23:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:42,553 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2021-05-06 05:23:42,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2021-05-06 05:23:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-06 05:23:42,554 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:42,554 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:42,554 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-06 05:23:42,554 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1869391561, now seen corresponding path program 1 times [2021-05-06 05:23:42,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:42,555 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504087036] [2021-05-06 05:23:42,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:42,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:42,635 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:42,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504087036] [2021-05-06 05:23:42,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504087036] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:42,636 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:42,636 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:42,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371549820] [2021-05-06 05:23:42,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:42,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:42,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:42,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:42,637 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:43,018 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2021-05-06 05:23:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-06 05:23:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:43,020 INFO L225 Difference]: With dead ends: 463 [2021-05-06 05:23:43,020 INFO L226 Difference]: Without dead ends: 463 [2021-05-06 05:23:43,020 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-06 05:23:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-06 05:23:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4951923076923077) internal successors, (622), 416 states have internal predecessors, (622), 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) [2021-05-06 05:23:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2021-05-06 05:23:43,027 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2021-05-06 05:23:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:43,027 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2021-05-06 05:23:43,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2021-05-06 05:23:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-06 05:23:43,028 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:43,028 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-06 05:23:43,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-06 05:23:43,028 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1977161256, now seen corresponding path program 1 times [2021-05-06 05:23:43,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:43,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476454564] [2021-05-06 05:23:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:43,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:43,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:43,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476454564] [2021-05-06 05:23:43,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476454564] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:43,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:43,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:43,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529972249] [2021-05-06 05:23:43,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:43,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:43,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:43,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:43,117 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:43,510 INFO L93 Difference]: Finished difference Result 463 states and 677 transitions. [2021-05-06 05:23:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-06 05:23:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:43,512 INFO L225 Difference]: With dead ends: 463 [2021-05-06 05:23:43,512 INFO L226 Difference]: Without dead ends: 463 [2021-05-06 05:23:43,512 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-06 05:23:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-06 05:23:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4903846153846154) internal successors, (620), 416 states have internal predecessors, (620), 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) [2021-05-06 05:23:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2021-05-06 05:23:43,519 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2021-05-06 05:23:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:43,519 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2021-05-06 05:23:43,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2021-05-06 05:23:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-06 05:23:43,520 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:43,520 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:43,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-06 05:23:43,521 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash -913417389, now seen corresponding path program 1 times [2021-05-06 05:23:43,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:43,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517260430] [2021-05-06 05:23:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:43,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:43,592 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:43,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517260430] [2021-05-06 05:23:43,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517260430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:43,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:43,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:43,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131161586] [2021-05-06 05:23:43,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:43,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:43,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:43,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:43,593 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:44,141 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2021-05-06 05:23:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:44,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-06 05:23:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:44,143 INFO L225 Difference]: With dead ends: 535 [2021-05-06 05:23:44,143 INFO L226 Difference]: Without dead ends: 535 [2021-05-06 05:23:44,143 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-05-06 05:23:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2021-05-06 05:23:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4855769230769231) internal successors, (618), 416 states have internal predecessors, (618), 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) [2021-05-06 05:23:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2021-05-06 05:23:44,149 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2021-05-06 05:23:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:44,150 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2021-05-06 05:23:44,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2021-05-06 05:23:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-06 05:23:44,151 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:44,151 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-06 05:23:44,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-06 05:23:44,151 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:44,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:44,151 INFO L82 PathProgramCache]: Analyzing trace with hash 597539124, now seen corresponding path program 1 times [2021-05-06 05:23:44,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:44,151 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614929967] [2021-05-06 05:23:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:44,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:44,212 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:44,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614929967] [2021-05-06 05:23:44,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614929967] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:44,213 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:44,213 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:44,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757814883] [2021-05-06 05:23:44,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:44,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:44,214 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:44,729 INFO L93 Difference]: Finished difference Result 529 states and 773 transitions. [2021-05-06 05:23:44,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:44,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-06 05:23:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:44,731 INFO L225 Difference]: With dead ends: 529 [2021-05-06 05:23:44,731 INFO L226 Difference]: Without dead ends: 529 [2021-05-06 05:23:44,731 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-05-06 05:23:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-05-06 05:23:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4807692307692308) internal successors, (616), 416 states have internal predecessors, (616), 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) [2021-05-06 05:23:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2021-05-06 05:23:44,737 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2021-05-06 05:23:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:44,737 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2021-05-06 05:23:44,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2021-05-06 05:23:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-06 05:23:44,738 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:44,738 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:44,738 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-06 05:23:44,739 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash 548162610, now seen corresponding path program 1 times [2021-05-06 05:23:44,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:44,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815592434] [2021-05-06 05:23:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:44,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:44,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:44,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815592434] [2021-05-06 05:23:44,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815592434] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:44,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:44,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:44,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531745583] [2021-05-06 05:23:44,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:44,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:44,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:44,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:44,799 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:45,193 INFO L93 Difference]: Finished difference Result 463 states and 671 transitions. [2021-05-06 05:23:45,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:45,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-06 05:23:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:45,195 INFO L225 Difference]: With dead ends: 463 [2021-05-06 05:23:45,195 INFO L226 Difference]: Without dead ends: 463 [2021-05-06 05:23:45,196 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-06 05:23:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2021-05-06 05:23:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4759615384615385) internal successors, (614), 416 states have internal predecessors, (614), 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) [2021-05-06 05:23:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2021-05-06 05:23:45,201 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2021-05-06 05:23:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:45,202 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2021-05-06 05:23:45,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2021-05-06 05:23:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-06 05:23:45,203 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:45,203 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-05-06 05:23:45,203 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-06 05:23:45,203 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2059119123, now seen corresponding path program 1 times [2021-05-06 05:23:45,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:45,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960183638] [2021-05-06 05:23:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:45,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:45,265 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:45,265 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960183638] [2021-05-06 05:23:45,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960183638] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:45,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:45,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:45,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369891601] [2021-05-06 05:23:45,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:45,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:45,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:45,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:45,268 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:45,630 INFO L93 Difference]: Finished difference Result 457 states and 662 transitions. [2021-05-06 05:23:45,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:45,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-06 05:23:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:45,632 INFO L225 Difference]: With dead ends: 457 [2021-05-06 05:23:45,632 INFO L226 Difference]: Without dead ends: 457 [2021-05-06 05:23:45,632 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-05-06 05:23:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2021-05-06 05:23:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4711538461538463) internal successors, (612), 416 states have internal predecessors, (612), 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) [2021-05-06 05:23:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2021-05-06 05:23:45,637 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2021-05-06 05:23:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:45,638 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2021-05-06 05:23:45,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2021-05-06 05:23:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-06 05:23:45,639 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:45,639 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:45,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-06 05:23:45,639 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1521790618, now seen corresponding path program 1 times [2021-05-06 05:23:45,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:45,639 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660847172] [2021-05-06 05:23:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:45,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:45,696 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:45,696 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660847172] [2021-05-06 05:23:45,696 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660847172] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:45,696 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:45,696 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:45,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135461225] [2021-05-06 05:23:45,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:45,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:45,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:45,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:45,697 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:46,183 INFO L93 Difference]: Finished difference Result 529 states and 767 transitions. [2021-05-06 05:23:46,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:46,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 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 80 [2021-05-06 05:23:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:46,189 INFO L225 Difference]: With dead ends: 529 [2021-05-06 05:23:46,189 INFO L226 Difference]: Without dead ends: 529 [2021-05-06 05:23:46,189 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-05-06 05:23:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-05-06 05:23:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4663461538461537) internal successors, (610), 416 states have internal predecessors, (610), 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) [2021-05-06 05:23:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2021-05-06 05:23:46,195 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2021-05-06 05:23:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:46,195 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2021-05-06 05:23:46,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2021-05-06 05:23:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-06 05:23:46,196 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:46,197 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:46,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-06 05:23:46,197 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:46,197 INFO L82 PathProgramCache]: Analyzing trace with hash -413869669, now seen corresponding path program 1 times [2021-05-06 05:23:46,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:46,197 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653662011] [2021-05-06 05:23:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:46,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:46,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:46,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653662011] [2021-05-06 05:23:46,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653662011] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:46,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:46,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:46,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276925564] [2021-05-06 05:23:46,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:46,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:46,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:46,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:46,261 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:46,639 INFO L93 Difference]: Finished difference Result 457 states and 658 transitions. [2021-05-06 05:23:46,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:46,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 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 80 [2021-05-06 05:23:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:46,641 INFO L225 Difference]: With dead ends: 457 [2021-05-06 05:23:46,641 INFO L226 Difference]: Without dead ends: 457 [2021-05-06 05:23:46,641 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-05-06 05:23:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2021-05-06 05:23:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4615384615384615) internal successors, (608), 416 states have internal predecessors, (608), 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) [2021-05-06 05:23:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2021-05-06 05:23:46,646 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2021-05-06 05:23:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:46,646 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2021-05-06 05:23:46,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2021-05-06 05:23:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-06 05:23:46,647 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:46,647 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:46,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-06 05:23:46,647 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1148974748, now seen corresponding path program 1 times [2021-05-06 05:23:46,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:46,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421482719] [2021-05-06 05:23:46,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:46,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:46,704 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:46,704 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421482719] [2021-05-06 05:23:46,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421482719] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:46,704 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:46,705 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:46,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951686] [2021-05-06 05:23:46,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:46,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:46,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:46,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:46,705 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:47,212 INFO L93 Difference]: Finished difference Result 529 states and 763 transitions. [2021-05-06 05:23:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:47,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-06 05:23:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:47,214 INFO L225 Difference]: With dead ends: 529 [2021-05-06 05:23:47,214 INFO L226 Difference]: Without dead ends: 529 [2021-05-06 05:23:47,215 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-05-06 05:23:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2021-05-06 05:23:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4567307692307692) internal successors, (606), 416 states have internal predecessors, (606), 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) [2021-05-06 05:23:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2021-05-06 05:23:47,219 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2021-05-06 05:23:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:47,220 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2021-05-06 05:23:47,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2021-05-06 05:23:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-06 05:23:47,221 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:47,221 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:47,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-06 05:23:47,221 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash 756227318, now seen corresponding path program 1 times [2021-05-06 05:23:47,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:47,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706608967] [2021-05-06 05:23:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:47,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-05-06 05:23:47,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:47,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706608967] [2021-05-06 05:23:47,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706608967] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:47,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:47,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:47,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517900217] [2021-05-06 05:23:47,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:47,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:47,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:47,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:47,279 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:47,734 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2021-05-06 05:23:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-06 05:23:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:47,736 INFO L225 Difference]: With dead ends: 511 [2021-05-06 05:23:47,736 INFO L226 Difference]: Without dead ends: 511 [2021-05-06 05:23:47,736 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-05-06 05:23:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2021-05-06 05:23:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4519230769230769) internal successors, (604), 416 states have internal predecessors, (604), 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) [2021-05-06 05:23:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2021-05-06 05:23:47,741 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2021-05-06 05:23:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:47,741 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2021-05-06 05:23:47,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2021-05-06 05:23:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-06 05:23:47,742 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:47,742 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:47,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-06 05:23:47,742 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1273047995, now seen corresponding path program 1 times [2021-05-06 05:23:47,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:47,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929571755] [2021-05-06 05:23:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:47,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-05-06 05:23:47,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:47,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929571755] [2021-05-06 05:23:47,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929571755] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:47,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:47,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 05:23:47,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785858552] [2021-05-06 05:23:47,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 05:23:47,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:47,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 05:23:47,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:47,795 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:48,182 INFO L93 Difference]: Finished difference Result 573 states and 826 transitions. [2021-05-06 05:23:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 05:23:48,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-06 05:23:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:48,186 INFO L225 Difference]: With dead ends: 573 [2021-05-06 05:23:48,186 INFO L226 Difference]: Without dead ends: 573 [2021-05-06 05:23:48,186 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-05-06 05:23:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2021-05-06 05:23:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 568 states have (on average 1.4471830985915493) internal successors, (822), 568 states have internal predecessors, (822), 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) [2021-05-06 05:23:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 826 transitions. [2021-05-06 05:23:48,192 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 826 transitions. Word has length 81 [2021-05-06 05:23:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:48,192 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 826 transitions. [2021-05-06 05:23:48,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 826 transitions. [2021-05-06 05:23:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-06 05:23:48,193 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:48,193 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:48,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-06 05:23:48,193 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1327386226, now seen corresponding path program 1 times [2021-05-06 05:23:48,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:48,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424284004] [2021-05-06 05:23:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:48,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-05-06 05:23:48,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:48,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424284004] [2021-05-06 05:23:48,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424284004] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:48,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:48,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 05:23:48,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625973346] [2021-05-06 05:23:48,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 05:23:48,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 05:23:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:48,254 INFO L87 Difference]: Start difference. First operand 573 states and 826 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:48,501 INFO L93 Difference]: Finished difference Result 726 states and 1049 transitions. [2021-05-06 05:23:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 05:23:48,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-06 05:23:48,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:48,503 INFO L225 Difference]: With dead ends: 726 [2021-05-06 05:23:48,503 INFO L226 Difference]: Without dead ends: 726 [2021-05-06 05:23:48,503 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-05-06 05:23:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2021-05-06 05:23:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 721 states have (on average 1.449375866851595) internal successors, (1045), 721 states have internal predecessors, (1045), 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) [2021-05-06 05:23:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1049 transitions. [2021-05-06 05:23:48,511 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1049 transitions. Word has length 83 [2021-05-06 05:23:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:48,511 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1049 transitions. [2021-05-06 05:23:48,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1049 transitions. [2021-05-06 05:23:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-06 05:23:48,512 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:48,512 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:48,512 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-06 05:23:48,512 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:48,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1358069101, now seen corresponding path program 1 times [2021-05-06 05:23:48,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:48,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023793676] [2021-05-06 05:23:48,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:48,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-06 05:23:48,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:48,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023793676] [2021-05-06 05:23:48,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023793676] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:48,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:48,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 05:23:48,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897984969] [2021-05-06 05:23:48,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 05:23:48,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:48,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 05:23:48,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:48,569 INFO L87 Difference]: Start difference. First operand 726 states and 1049 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:48,937 INFO L93 Difference]: Finished difference Result 723 states and 1039 transitions. [2021-05-06 05:23:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 05:23:48,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2021-05-06 05:23:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:48,940 INFO L225 Difference]: With dead ends: 723 [2021-05-06 05:23:48,940 INFO L226 Difference]: Without dead ends: 723 [2021-05-06 05:23:48,940 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:23:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-05-06 05:23:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-05-06 05:23:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 718 states have (on average 1.4415041782729805) internal successors, (1035), 718 states have internal predecessors, (1035), 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) [2021-05-06 05:23:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1039 transitions. [2021-05-06 05:23:48,947 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1039 transitions. Word has length 104 [2021-05-06 05:23:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:48,948 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 1039 transitions. [2021-05-06 05:23:48,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1039 transitions. [2021-05-06 05:23:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-05-06 05:23:48,949 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:48,949 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:48,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-06 05:23:48,949 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:48,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:48,950 INFO L82 PathProgramCache]: Analyzing trace with hash 596214831, now seen corresponding path program 1 times [2021-05-06 05:23:48,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:48,950 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902008435] [2021-05-06 05:23:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:49,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-06 05:23:49,012 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:49,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902008435] [2021-05-06 05:23:49,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902008435] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:49,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:49,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:49,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841183295] [2021-05-06 05:23:49,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:49,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:49,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:49,013 INFO L87 Difference]: Start difference. First operand 723 states and 1039 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:49,424 INFO L93 Difference]: Finished difference Result 979 states and 1408 transitions. [2021-05-06 05:23:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:49,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2021-05-06 05:23:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:49,427 INFO L225 Difference]: With dead ends: 979 [2021-05-06 05:23:49,427 INFO L226 Difference]: Without dead ends: 979 [2021-05-06 05:23:49,427 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-05-06 05:23:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 843. [2021-05-06 05:23:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.4856801909307875) internal successors, (1245), 838 states have internal predecessors, (1245), 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) [2021-05-06 05:23:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1249 transitions. [2021-05-06 05:23:49,442 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1249 transitions. Word has length 106 [2021-05-06 05:23:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:49,442 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1249 transitions. [2021-05-06 05:23:49,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1249 transitions. [2021-05-06 05:23:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-06 05:23:49,444 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:49,444 INFO L523 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, 1, 1] [2021-05-06 05:23:49,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-06 05:23:49,444 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash -903827051, now seen corresponding path program 1 times [2021-05-06 05:23:49,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:49,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857041038] [2021-05-06 05:23:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:49,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-06 05:23:49,510 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:49,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857041038] [2021-05-06 05:23:49,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857041038] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:49,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:49,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:49,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076548348] [2021-05-06 05:23:49,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:49,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:49,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:49,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:49,513 INFO L87 Difference]: Start difference. First operand 843 states and 1249 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:49,914 INFO L93 Difference]: Finished difference Result 974 states and 1398 transitions. [2021-05-06 05:23:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-06 05:23:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:49,917 INFO L225 Difference]: With dead ends: 974 [2021-05-06 05:23:49,917 INFO L226 Difference]: Without dead ends: 974 [2021-05-06 05:23:49,917 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-05-06 05:23:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-05-06 05:23:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.4797136038186158) internal successors, (1240), 838 states have internal predecessors, (1240), 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) [2021-05-06 05:23:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1244 transitions. [2021-05-06 05:23:49,926 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1244 transitions. Word has length 121 [2021-05-06 05:23:49,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:49,927 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1244 transitions. [2021-05-06 05:23:49,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1244 transitions. [2021-05-06 05:23:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-06 05:23:49,928 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:49,928 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 1] [2021-05-06 05:23:49,928 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-06 05:23:49,928 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:49,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2062011979, now seen corresponding path program 1 times [2021-05-06 05:23:49,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:49,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541304240] [2021-05-06 05:23:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:49,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-06 05:23:49,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:49,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541304240] [2021-05-06 05:23:49,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541304240] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:49,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:49,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:49,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128090586] [2021-05-06 05:23:49,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:49,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:49,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:49,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:49,992 INFO L87 Difference]: Start difference. First operand 843 states and 1244 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:50,407 INFO L93 Difference]: Finished difference Result 974 states and 1393 transitions. [2021-05-06 05:23:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:50,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-06 05:23:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:50,410 INFO L225 Difference]: With dead ends: 974 [2021-05-06 05:23:50,410 INFO L226 Difference]: Without dead ends: 974 [2021-05-06 05:23:50,410 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:50,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-05-06 05:23:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-05-06 05:23:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 838 states have (on average 1.473747016706444) internal successors, (1235), 838 states have internal predecessors, (1235), 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) [2021-05-06 05:23:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1239 transitions. [2021-05-06 05:23:50,419 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1239 transitions. Word has length 121 [2021-05-06 05:23:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:50,420 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1239 transitions. [2021-05-06 05:23:50,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1239 transitions. [2021-05-06 05:23:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-06 05:23:50,422 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:50,422 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:23:50,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-06 05:23:50,422 INFO L428 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:50,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:50,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1745493526, now seen corresponding path program 1 times [2021-05-06 05:23:50,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:50,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093435956] [2021-05-06 05:23:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:50,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-05-06 05:23:50,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:50,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093435956] [2021-05-06 05:23:50,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093435956] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:50,503 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:50,503 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:50,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454726321] [2021-05-06 05:23:50,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:50,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:50,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:50,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:50,504 INFO L87 Difference]: Start difference. First operand 843 states and 1239 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) [2021-05-06 05:23:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:50,859 INFO L93 Difference]: Finished difference Result 981 states and 1438 transitions. [2021-05-06 05:23:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:50,859 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 121 [2021-05-06 05:23:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:50,862 INFO L225 Difference]: With dead ends: 981 [2021-05-06 05:23:50,862 INFO L226 Difference]: Without dead ends: 981 [2021-05-06 05:23:50,862 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-05-06 05:23:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 915. [2021-05-06 05:23:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.489010989010989) internal successors, (1355), 910 states have internal predecessors, (1355), 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) [2021-05-06 05:23:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1359 transitions. [2021-05-06 05:23:50,877 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1359 transitions. Word has length 121 [2021-05-06 05:23:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:50,877 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1359 transitions. [2021-05-06 05:23:50,877 INFO L481 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) [2021-05-06 05:23:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1359 transitions. [2021-05-06 05:23:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-05-06 05:23:50,879 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:50,879 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1] [2021-05-06 05:23:50,879 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-06 05:23:50,879 INFO L428 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 586575468, now seen corresponding path program 1 times [2021-05-06 05:23:50,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:50,880 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102635161] [2021-05-06 05:23:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:50,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-06 05:23:50,943 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:50,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102635161] [2021-05-06 05:23:50,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102635161] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:50,943 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:50,943 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:50,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235660048] [2021-05-06 05:23:50,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:50,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:50,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:50,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:50,944 INFO L87 Difference]: Start difference. First operand 915 states and 1359 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:51,348 INFO L93 Difference]: Finished difference Result 1046 states and 1508 transitions. [2021-05-06 05:23:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:51,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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 122 [2021-05-06 05:23:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:51,351 INFO L225 Difference]: With dead ends: 1046 [2021-05-06 05:23:51,351 INFO L226 Difference]: Without dead ends: 1046 [2021-05-06 05:23:51,352 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-05-06 05:23:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-05-06 05:23:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.4835164835164836) internal successors, (1350), 910 states have internal predecessors, (1350), 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) [2021-05-06 05:23:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1354 transitions. [2021-05-06 05:23:51,361 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1354 transitions. Word has length 122 [2021-05-06 05:23:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:51,361 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1354 transitions. [2021-05-06 05:23:51,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1354 transitions. [2021-05-06 05:23:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-06 05:23:51,362 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:51,363 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 1] [2021-05-06 05:23:51,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-06 05:23:51,363 INFO L428 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash 943634585, now seen corresponding path program 1 times [2021-05-06 05:23:51,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:51,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966929244] [2021-05-06 05:23:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:51,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-06 05:23:51,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:51,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966929244] [2021-05-06 05:23:51,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966929244] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:51,425 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:51,425 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:51,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519282040] [2021-05-06 05:23:51,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:51,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:51,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:51,426 INFO L87 Difference]: Start difference. First operand 915 states and 1354 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:51,802 INFO L93 Difference]: Finished difference Result 1046 states and 1503 transitions. [2021-05-06 05:23:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:51,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2021-05-06 05:23:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:51,805 INFO L225 Difference]: With dead ends: 1046 [2021-05-06 05:23:51,805 INFO L226 Difference]: Without dead ends: 1046 [2021-05-06 05:23:51,805 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-05-06 05:23:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-05-06 05:23:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 910 states have (on average 1.478021978021978) internal successors, (1345), 910 states have internal predecessors, (1345), 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) [2021-05-06 05:23:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1349 transitions. [2021-05-06 05:23:51,815 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1349 transitions. Word has length 123 [2021-05-06 05:23:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:51,815 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1349 transitions. [2021-05-06 05:23:51,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1349 transitions. [2021-05-06 05:23:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-05-06 05:23:51,816 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:51,816 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2021-05-06 05:23:51,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-06 05:23:51,817 INFO L428 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash 639627317, now seen corresponding path program 1 times [2021-05-06 05:23:51,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:51,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903301846] [2021-05-06 05:23:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:51,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-05-06 05:23:51,876 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:51,876 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903301846] [2021-05-06 05:23:51,876 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903301846] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:51,876 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:51,876 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:51,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269475004] [2021-05-06 05:23:51,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:51,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:51,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:51,877 INFO L87 Difference]: Start difference. First operand 915 states and 1349 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:52,295 INFO L93 Difference]: Finished difference Result 1146 states and 1683 transitions. [2021-05-06 05:23:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:52,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2021-05-06 05:23:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:52,298 INFO L225 Difference]: With dead ends: 1146 [2021-05-06 05:23:52,298 INFO L226 Difference]: Without dead ends: 1146 [2021-05-06 05:23:52,298 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-05-06 05:23:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1025. [2021-05-06 05:23:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1020 states have (on average 1.5049019607843137) internal successors, (1535), 1020 states have internal predecessors, (1535), 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) [2021-05-06 05:23:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1539 transitions. [2021-05-06 05:23:52,310 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1539 transitions. Word has length 124 [2021-05-06 05:23:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:52,310 INFO L480 AbstractCegarLoop]: Abstraction has 1025 states and 1539 transitions. [2021-05-06 05:23:52,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1539 transitions. [2021-05-06 05:23:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-05-06 05:23:52,312 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:52,312 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 1] [2021-05-06 05:23:52,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-06 05:23:52,312 INFO L428 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:52,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1166469135, now seen corresponding path program 1 times [2021-05-06 05:23:52,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:52,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669212404] [2021-05-06 05:23:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:52,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-05-06 05:23:52,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:52,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669212404] [2021-05-06 05:23:52,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669212404] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:52,381 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:52,381 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:23:52,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530250567] [2021-05-06 05:23:52,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:23:52,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:23:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:23:52,382 INFO L87 Difference]: Start difference. First operand 1025 states and 1539 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:52,743 INFO L93 Difference]: Finished difference Result 1111 states and 1633 transitions. [2021-05-06 05:23:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:23:52,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 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 124 [2021-05-06 05:23:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:52,746 INFO L225 Difference]: With dead ends: 1111 [2021-05-06 05:23:52,746 INFO L226 Difference]: Without dead ends: 1111 [2021-05-06 05:23:52,746 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:23:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-05-06 05:23:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1025. [2021-05-06 05:23:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1020 states have (on average 1.5) internal successors, (1530), 1020 states have internal predecessors, (1530), 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) [2021-05-06 05:23:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1534 transitions. [2021-05-06 05:23:52,756 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1534 transitions. Word has length 124 [2021-05-06 05:23:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:52,756 INFO L480 AbstractCegarLoop]: Abstraction has 1025 states and 1534 transitions. [2021-05-06 05:23:52,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1534 transitions. [2021-05-06 05:23:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-06 05:23:52,757 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:52,758 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2021-05-06 05:23:52,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-06 05:23:52,758 INFO L428 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:52,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash 998047110, now seen corresponding path program 1 times [2021-05-06 05:23:52,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:52,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380023099] [2021-05-06 05:23:52,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:52,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:23:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:23:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-05-06 05:23:52,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:23:52,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380023099] [2021-05-06 05:23:52,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380023099] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:23:52,881 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:23:52,881 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 05:23:52,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569958481] [2021-05-06 05:23:52,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 05:23:52,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:23:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 05:23:52,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:23:52,882 INFO L87 Difference]: Start difference. First operand 1025 states and 1534 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:23:53,305 INFO L93 Difference]: Finished difference Result 1029 states and 1538 transitions. [2021-05-06 05:23:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 05:23:53,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2021-05-06 05:23:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:23:53,311 INFO L225 Difference]: With dead ends: 1029 [2021-05-06 05:23:53,311 INFO L226 Difference]: Without dead ends: 1029 [2021-05-06 05:23:53,312 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 88.3ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-05-06 05:23:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-05-06 05:23:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1028. [2021-05-06 05:23:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1023 states have (on average 1.498533724340176) internal successors, (1533), 1023 states have internal predecessors, (1533), 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) [2021-05-06 05:23:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1537 transitions. [2021-05-06 05:23:53,321 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1537 transitions. Word has length 128 [2021-05-06 05:23:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:23:53,321 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1537 transitions. [2021-05-06 05:23:53,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:23:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1537 transitions. [2021-05-06 05:23:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-06 05:23:53,323 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:23:53,323 INFO L523 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] [2021-05-06 05:23:53,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-06 05:23:53,323 INFO L428 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:23:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:23:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash 144716696, now seen corresponding path program 1 times [2021-05-06 05:23:53,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:23:53,323 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185176331] [2021-05-06 05:23:53,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:23:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 05:23:53,399 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 05:23:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 05:23:53,490 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 05:23:53,548 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-06 05:23:53,549 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-06 05:23:53,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-06 05:23:53,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:23:53 BasicIcfg [2021-05-06 05:23:53,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 05:23:53,669 INFO L168 Benchmark]: Toolchain (without parser) took 19879.38 ms. Allocated memory was 180.4 MB in the beginning and 436.2 MB in the end (delta: 255.9 MB). Free memory was 143.5 MB in the beginning and 306.2 MB in the end (delta: -162.7 MB). Peak memory consumption was 94.4 MB. Max. memory is 8.0 GB. [2021-05-06 05:23:53,669 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 180.4 MB. Free memory is still 162.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 05:23:53,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 486.63 ms. Allocated memory is still 180.4 MB. Free memory was 143.3 MB in the beginning and 144.9 MB in the end (delta: -1.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 8.0 GB. [2021-05-06 05:23:53,670 INFO L168 Benchmark]: Boogie Preprocessor took 88.80 ms. Allocated memory is still 180.4 MB. Free memory was 144.9 MB in the beginning and 137.6 MB in the end (delta: 7.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-05-06 05:23:53,673 INFO L168 Benchmark]: RCFGBuilder took 825.65 ms. Allocated memory was 180.4 MB in the beginning and 221.2 MB in the end (delta: 40.9 MB). Free memory was 137.6 MB in the beginning and 146.5 MB in the end (delta: -8.9 MB). Peak memory consumption was 40.8 MB. Max. memory is 8.0 GB. [2021-05-06 05:23:53,673 INFO L168 Benchmark]: IcfgTransformer took 32.62 ms. Allocated memory is still 221.2 MB. Free memory was 146.5 MB in the beginning and 142.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-05-06 05:23:53,674 INFO L168 Benchmark]: TraceAbstraction took 18437.99 ms. Allocated memory was 221.2 MB in the beginning and 436.2 MB in the end (delta: 215.0 MB). Free memory was 141.8 MB in the beginning and 306.2 MB in the end (delta: -164.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 8.0 GB. [2021-05-06 05:23:53,675 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.09 ms. Allocated memory is still 180.4 MB. Free memory is still 162.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 486.63 ms. Allocated memory is still 180.4 MB. Free memory was 143.3 MB in the beginning and 144.9 MB in the end (delta: -1.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 88.80 ms. Allocated memory is still 180.4 MB. Free memory was 144.9 MB in the beginning and 137.6 MB in the end (delta: 7.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * RCFGBuilder took 825.65 ms. Allocated memory was 180.4 MB in the beginning and 221.2 MB in the end (delta: 40.9 MB). Free memory was 137.6 MB in the beginning and 146.5 MB in the end (delta: -8.9 MB). Peak memory consumption was 40.8 MB. Max. memory is 8.0 GB. * IcfgTransformer took 32.62 ms. Allocated memory is still 221.2 MB. Free memory was 146.5 MB in the beginning and 142.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18437.99 ms. Allocated memory was 221.2 MB in the beginning and 436.2 MB in the end (delta: 215.0 MB). Free memory was 141.8 MB in the beginning and 306.2 MB in the end (delta: -164.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 8.0 GB. * 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: - UnprovableResult [Line: 1647]: 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 1332. Possible FailurePath: [L1041] static int init = 1; [L1042] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967352, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={8:0}] [L1064] SSL *s ; [L1068] s = malloc (sizeof (SSL)) [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->state = 12292 [L1072] s->version = __VERIFIER_nondet_int() [L1073] CALL ssl3_connect(s) VAL [init=1, s={-3:0}, SSLv3_client_data={8:0}] [L1079] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1080] unsigned long tmp ; [L1081] unsigned long l ; [L1082] long num1 ; [L1083] void (*cb)() ; [L1084] int ret ; [L1085] int new_state ; [L1086] int state ; [L1087] int skip ; [L1088] int *tmp___0 ; [L1089] int tmp___1 = __VERIFIER_nondet_int(); [L1090] int tmp___2 = __VERIFIER_nondet_int(); [L1091] int tmp___3 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->state = 12292 [L1104] s->hit = __VERIFIER_nondet_int() [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] tmp___0 = (int*)malloc(sizeof(int)) [L1111] *tmp___0 = 0 [L1112] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->info_callback={0:-4294967295}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1112] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1113] EXPR s->info_callback [L1113] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=12292, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1135] COND TRUE s->state == 12292 [L1238] s->new_session = 1 [L1239] s->state = 4096 [L1240] EXPR s->ctx [L1240] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1240] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1245] s->server = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1246] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1251] EXPR s->version VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->version=-2, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1251] COND FALSE !((s->version & 65280) != 768) [L1257] s->type = 4096 [L1258] EXPR s->init_buf VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->init_buf={13:-12}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0] [L1258] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1270] tmp___4 = __VERIFIER_nondet_int() [L1271] COND FALSE !(! tmp___4) [L1277] tmp___5 = __VERIFIER_nondet_int() [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=12292, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=0, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=-1, s={-3:0}, s={-3:0}, s->state=4368, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->bbio={17:-14}, s->wbio={-13:15}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4368, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=1, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=14, s={-3:0}, s={-3:0}, s->state=4384, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1318] COND FALSE !(ret <= 0) [L1323] s->hit VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->hit=0, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1323] COND FALSE !(s->hit) [L1326] s->state = 4400 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1328] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4384, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4400, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1162] COND TRUE s->state == 4400 [L1332] EXPR s->s3 [L1332] EXPR (s->s3)->tmp.new_cipher [L1332] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-4294967295}, ((s->s3)->tmp.new_cipher)->algorithms=4294967313, (s->s3)->tmp.new_cipher={4294967351:18}, blastFlag=2, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1332] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1335] ret = __VERIFIER_nondet_int() [L1336] COND TRUE blastFlag == 2 [L1337] blastFlag = 3 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1341] COND FALSE !(ret <= 0) VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1347] s->state = 4416 [L1348] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4400, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=3, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4416, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1168] COND TRUE s->state == 4416 [L1352] ret = __VERIFIER_nondet_int() [L1353] COND TRUE blastFlag == 3 [L1354] blastFlag = 4 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9] [L1358] COND FALSE !(ret <= 0) [L1363] s->state = 4432 [L1364] s->init_num = 0 [L1365] tmp___6 = __VERIFIER_nondet_int() [L1366] COND FALSE !(! tmp___6) VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4416, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4432, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1174] COND TRUE s->state == 4432 [L1375] ret = __VERIFIER_nondet_int() [L1376] COND FALSE !(blastFlag == 5) VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1381] COND FALSE !(ret <= 0) [L1386] s->state = 4448 [L1387] s->init_num = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.reuse_message VAL [={0:-4294967295}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1606] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1635] skip = 0 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1132] COND TRUE 1 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4432, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1134] EXPR s->state [L1134] state = s->state [L1135] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1135] COND FALSE !(s->state == 12292) [L1138] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1138] COND FALSE !(s->state == 16384) [L1141] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1141] COND FALSE !(s->state == 4096) [L1144] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1144] COND FALSE !(s->state == 20480) [L1147] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1147] COND FALSE !(s->state == 4099) [L1150] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1150] COND FALSE !(s->state == 4368) [L1153] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1153] COND FALSE !(s->state == 4369) [L1156] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1156] COND FALSE !(s->state == 4384) [L1159] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1159] COND FALSE !(s->state == 4385) [L1162] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1162] COND FALSE !(s->state == 4400) [L1165] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1165] COND FALSE !(s->state == 4401) [L1168] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1168] COND FALSE !(s->state == 4416) [L1171] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1171] COND FALSE !(s->state == 4417) [L1174] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1174] COND FALSE !(s->state == 4432) [L1177] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1177] COND FALSE !(s->state == 4433) [L1180] EXPR s->state VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=1, s={-3:0}, s={-3:0}, s->state=4448, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1180] COND TRUE s->state == 4448 [L1391] ret = __VERIFIER_nondet_int() [L1392] COND TRUE blastFlag == 4 VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=0, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] [L1647] reach_error() VAL [={0:-4294967295}, blastFlag=4, buf={0:-1}, init=1, malloc(sizeof(int))={-6:0}, ret=0, s={-3:0}, s={-3:0}, skip=0, SSLv3_client_data={8:0}, state=4448, tmp=0, tmp___0={-6:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=-9, tmp___6=-15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18277.9ms, OverallIterations: 34, TraceHistogramMax: 7, EmptinessCheckTime: 54.7ms, AutomataDifference: 14952.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7432 SDtfs, 2625 SDslu, 9610 SDs, 0 SdLazy, 13971 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11410.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 100 SyntacticMatches, 20 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1166.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=33, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 294.8ms AutomataMinimizationTime, 33 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 127.7ms SsaConstructionTime, 486.1ms SatisfiabilityAnalysisTime, 1959.5ms InterpolantComputationTime, 3003 NumberOfCodeBlocks, 3003 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2827 ConstructedInterpolants, 0 QuantifiedInterpolants, 8550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 2610/2610 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 Received shutdown request...