java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.02.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:03,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:03,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:03,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:03,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:03,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:03,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:03,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:03,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:03,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:03,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:03,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:03,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:03,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:03,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:03,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:03,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:03,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:03,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:03,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:03,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:03,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:03,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:03,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:03,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:03,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:03,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:03,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:03,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:03,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:03,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:03,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:03,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:03,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:03,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:03,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:03,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:03,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:03,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:03,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:03,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:03,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:03,806 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:03,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:03,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:03,807 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:03,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:03,808 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:03,808 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:03,808 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:03,809 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:03,809 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:03,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:03,810 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:03,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:03,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:03,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:03,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:03,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:03,811 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:03,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:03,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:03,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:03,812 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:03,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:03,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:03,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:03,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:03,813 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:03,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:03,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:03,813 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:03,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:03,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:03,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:03,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:03,860 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:03,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.02.i.cil-2.c [2019-09-20 13:27:03,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a65491049/c8e5a935bf0f4d26b546f1198d424c9a/FLAG20c917a3c [2019-09-20 13:27:04,518 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:04,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.02.i.cil-2.c [2019-09-20 13:27:04,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a65491049/c8e5a935bf0f4d26b546f1198d424c9a/FLAG20c917a3c [2019-09-20 13:27:04,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a65491049/c8e5a935bf0f4d26b546f1198d424c9a [2019-09-20 13:27:04,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:04,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:04,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:04,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:04,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:04,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:04" (1/1) ... [2019-09-20 13:27:04,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f64d273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:04, skipping insertion in model container [2019-09-20 13:27:04,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:04" (1/1) ... [2019-09-20 13:27:04,791 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:04,854 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:05,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:05,438 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:05,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:05,694 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:05,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05 WrapperNode [2019-09-20 13:27:05,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:05,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:05,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:05,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:05,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05" (1/1) ... [2019-09-20 13:27:05,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05" (1/1) ... [2019-09-20 13:27:05,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05" (1/1) ... [2019-09-20 13:27:05,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05" (1/1) ... [2019-09-20 13:27:05,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05" (1/1) ... [2019-09-20 13:27:05,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05" (1/1) ... [2019-09-20 13:27:05,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05" (1/1) ... [2019-09-20 13:27:05,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:05,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:05,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:05,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:05,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05" (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 [2019-09-20 13:27:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-20 13:27:05,967 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-20 13:27:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-20 13:27:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:05,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:05,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:05,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:05,972 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:05,972 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-20 13:27:05,972 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-20 13:27:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-20 13:27:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:06,537 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:07,185 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-20 13:27:07,185 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-20 13:27:07,214 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:07,215 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:07,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:07 BoogieIcfgContainer [2019-09-20 13:27:07,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:07,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:07,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:07,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:07,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:04" (1/3) ... [2019-09-20 13:27:07,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c70ba00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:07, skipping insertion in model container [2019-09-20 13:27:07,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:05" (2/3) ... [2019-09-20 13:27:07,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c70ba00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:07, skipping insertion in model container [2019-09-20 13:27:07,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:07" (3/3) ... [2019-09-20 13:27:07,227 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-2.c [2019-09-20 13:27:07,237 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:07,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:07,264 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:07,295 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:07,295 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:07,295 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:07,296 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:07,296 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:07,296 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:07,296 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:07,296 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-20 13:27:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:27:07,326 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,327 INFO L407 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] [2019-09-20 13:27:07,330 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-20 13:27:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:07,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:07,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:07,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:07,675 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-20 13:27:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,786 INFO L93 Difference]: Finished difference Result 253 states and 413 transitions. [2019-09-20 13:27:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:07,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:27:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,805 INFO L225 Difference]: With dead ends: 253 [2019-09-20 13:27:07,805 INFO L226 Difference]: Without dead ends: 218 [2019-09-20 13:27:07,807 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-20 13:27:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-09-20 13:27:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-20 13:27:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 322 transitions. [2019-09-20 13:27:07,885 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 322 transitions. Word has length 30 [2019-09-20 13:27:07,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,886 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 322 transitions. [2019-09-20 13:27:07,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 322 transitions. [2019-09-20 13:27:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:27:07,891 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,891 INFO L407 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] [2019-09-20 13:27:07,893 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash -359362032, now seen corresponding path program 1 times [2019-09-20 13:27:07,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:08,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:08,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:08,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:08,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:08,091 INFO L87 Difference]: Start difference. First operand 218 states and 322 transitions. Second operand 3 states. [2019-09-20 13:27:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,164 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-20 13:27:08,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:08,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:27:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,168 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:27:08,169 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:27:08,170 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:27:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-09-20 13:27:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-20 13:27:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2019-09-20 13:27:08,193 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2019-09-20 13:27:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,193 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2019-09-20 13:27:08,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2019-09-20 13:27:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:08,198 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,198 INFO L407 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] [2019-09-20 13:27:08,198 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash 31651983, now seen corresponding path program 1 times [2019-09-20 13:27:08,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:08,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:08,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:08,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:08,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:08,445 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2019-09-20 13:27:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,022 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2019-09-20 13:27:09,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:09,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,027 INFO L225 Difference]: With dead ends: 503 [2019-09-20 13:27:09,028 INFO L226 Difference]: Without dead ends: 503 [2019-09-20 13:27:09,028 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-20 13:27:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 368. [2019-09-20 13:27:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-20 13:27:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2019-09-20 13:27:09,069 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2019-09-20 13:27:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,070 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2019-09-20 13:27:09,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2019-09-20 13:27:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:09,074 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,075 INFO L407 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] [2019-09-20 13:27:09,075 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,076 INFO L82 PathProgramCache]: Analyzing trace with hash -102361523, now seen corresponding path program 1 times [2019-09-20 13:27:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:09,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:09,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:09,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:09,170 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2019-09-20 13:27:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,511 INFO L93 Difference]: Finished difference Result 453 states and 680 transitions. [2019-09-20 13:27:09,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:09,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,515 INFO L225 Difference]: With dead ends: 453 [2019-09-20 13:27:09,515 INFO L226 Difference]: Without dead ends: 453 [2019-09-20 13:27:09,515 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-20 13:27:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 408. [2019-09-20 13:27:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-20 13:27:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-20 13:27:09,530 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2019-09-20 13:27:09,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,531 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-20 13:27:09,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-20 13:27:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:09,535 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,535 INFO L407 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] [2019-09-20 13:27:09,536 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,536 INFO L82 PathProgramCache]: Analyzing trace with hash 976525712, now seen corresponding path program 1 times [2019-09-20 13:27:09,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:09,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:09,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:09,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:09,623 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-09-20 13:27:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,079 INFO L93 Difference]: Finished difference Result 535 states and 803 transitions. [2019-09-20 13:27:10,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:10,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,083 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:10,083 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:10,083 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 410. [2019-09-20 13:27:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2019-09-20 13:27:10,095 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2019-09-20 13:27:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,096 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2019-09-20 13:27:10,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2019-09-20 13:27:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:10,099 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,100 INFO L407 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] [2019-09-20 13:27:10,100 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1151289447, now seen corresponding path program 1 times [2019-09-20 13:27:10,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:10,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:10,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:10,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:10,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:10,235 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2019-09-20 13:27:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,653 INFO L93 Difference]: Finished difference Result 533 states and 799 transitions. [2019-09-20 13:27:10,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:10,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,657 INFO L225 Difference]: With dead ends: 533 [2019-09-20 13:27:10,657 INFO L226 Difference]: Without dead ends: 533 [2019-09-20 13:27:10,657 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-20 13:27:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-20 13:27:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2019-09-20 13:27:10,670 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2019-09-20 13:27:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,670 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2019-09-20 13:27:10,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2019-09-20 13:27:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:10,672 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,672 INFO L407 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] [2019-09-20 13:27:10,672 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,673 INFO L82 PathProgramCache]: Analyzing trace with hash 42309001, now seen corresponding path program 1 times [2019-09-20 13:27:10,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:10,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:10,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:10,750 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2019-09-20 13:27:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,223 INFO L93 Difference]: Finished difference Result 533 states and 797 transitions. [2019-09-20 13:27:11,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,227 INFO L225 Difference]: With dead ends: 533 [2019-09-20 13:27:11,227 INFO L226 Difference]: Without dead ends: 533 [2019-09-20 13:27:11,227 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-20 13:27:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-20 13:27:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2019-09-20 13:27:11,240 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2019-09-20 13:27:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,240 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2019-09-20 13:27:11,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2019-09-20 13:27:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:11,267 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,268 INFO L407 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] [2019-09-20 13:27:11,268 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,269 INFO L82 PathProgramCache]: Analyzing trace with hash 121930149, now seen corresponding path program 1 times [2019-09-20 13:27:11,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:11,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,340 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2019-09-20 13:27:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,631 INFO L93 Difference]: Finished difference Result 453 states and 674 transitions. [2019-09-20 13:27:11,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,635 INFO L225 Difference]: With dead ends: 453 [2019-09-20 13:27:11,635 INFO L226 Difference]: Without dead ends: 453 [2019-09-20 13:27:11,636 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-20 13:27:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-09-20 13:27:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2019-09-20 13:27:11,647 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2019-09-20 13:27:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,647 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2019-09-20 13:27:11,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2019-09-20 13:27:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:11,649 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,649 INFO L407 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] [2019-09-20 13:27:11,649 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,650 INFO L82 PathProgramCache]: Analyzing trace with hash -987050297, now seen corresponding path program 1 times [2019-09-20 13:27:11,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:11,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,722 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2019-09-20 13:27:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,006 INFO L93 Difference]: Finished difference Result 453 states and 672 transitions. [2019-09-20 13:27:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,011 INFO L225 Difference]: With dead ends: 453 [2019-09-20 13:27:12,011 INFO L226 Difference]: Without dead ends: 453 [2019-09-20 13:27:12,012 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-20 13:27:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-09-20 13:27:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-09-20 13:27:12,027 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2019-09-20 13:27:12,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,027 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-09-20 13:27:12,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-09-20 13:27:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:12,029 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,029 INFO L407 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] [2019-09-20 13:27:12,030 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1365972106, now seen corresponding path program 1 times [2019-09-20 13:27:12,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:12,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,114 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-09-20 13:27:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,635 INFO L93 Difference]: Finished difference Result 533 states and 791 transitions. [2019-09-20 13:27:12,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:12,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,640 INFO L225 Difference]: With dead ends: 533 [2019-09-20 13:27:12,640 INFO L226 Difference]: Without dead ends: 533 [2019-09-20 13:27:12,641 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-20 13:27:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-20 13:27:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-09-20 13:27:12,659 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2019-09-20 13:27:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,660 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-09-20 13:27:12,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-09-20 13:27:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:12,662 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,662 INFO L407 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] [2019-09-20 13:27:12,662 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,663 INFO L82 PathProgramCache]: Analyzing trace with hash -479395060, now seen corresponding path program 1 times [2019-09-20 13:27:12,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:12,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,785 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-09-20 13:27:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,098 INFO L93 Difference]: Finished difference Result 453 states and 668 transitions. [2019-09-20 13:27:13,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,102 INFO L225 Difference]: With dead ends: 453 [2019-09-20 13:27:13,102 INFO L226 Difference]: Without dead ends: 453 [2019-09-20 13:27:13,102 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-20 13:27:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-09-20 13:27:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2019-09-20 13:27:13,112 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2019-09-20 13:27:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,112 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2019-09-20 13:27:13,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2019-09-20 13:27:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:13,114 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,114 INFO L407 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] [2019-09-20 13:27:13,114 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,115 INFO L82 PathProgramCache]: Analyzing trace with hash -493563964, now seen corresponding path program 1 times [2019-09-20 13:27:13,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:13,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,187 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2019-09-20 13:27:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,625 INFO L93 Difference]: Finished difference Result 533 states and 787 transitions. [2019-09-20 13:27:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,628 INFO L225 Difference]: With dead ends: 533 [2019-09-20 13:27:13,629 INFO L226 Difference]: Without dead ends: 533 [2019-09-20 13:27:13,629 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-20 13:27:13,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-20 13:27:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2019-09-20 13:27:13,641 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 79 [2019-09-20 13:27:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,642 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2019-09-20 13:27:13,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2019-09-20 13:27:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:13,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,643 INFO L407 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, 1] [2019-09-20 13:27:13,643 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,644 INFO L82 PathProgramCache]: Analyzing trace with hash -565290761, now seen corresponding path program 1 times [2019-09-20 13:27:13,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:13,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:13,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:13,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:13,710 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 3 states. [2019-09-20 13:27:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,748 INFO L93 Difference]: Finished difference Result 559 states and 836 transitions. [2019-09-20 13:27:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:13,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-20 13:27:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,751 INFO L225 Difference]: With dead ends: 559 [2019-09-20 13:27:13,751 INFO L226 Difference]: Without dead ends: 559 [2019-09-20 13:27:13,752 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-20 13:27:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-20 13:27:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-20 13:27:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 836 transitions. [2019-09-20 13:27:13,765 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 836 transitions. Word has length 79 [2019-09-20 13:27:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,766 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 836 transitions. [2019-09-20 13:27:13,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 836 transitions. [2019-09-20 13:27:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:13,767 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,768 INFO L407 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] [2019-09-20 13:27:13,768 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2029348694, now seen corresponding path program 1 times [2019-09-20 13:27:13,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:13,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,849 INFO L87 Difference]: Start difference. First operand 559 states and 836 transitions. Second operand 4 states. [2019-09-20 13:27:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,297 INFO L93 Difference]: Finished difference Result 744 states and 1098 transitions. [2019-09-20 13:27:14,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,305 INFO L225 Difference]: With dead ends: 744 [2019-09-20 13:27:14,305 INFO L226 Difference]: Without dead ends: 744 [2019-09-20 13:27:14,306 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-20 13:27:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 559. [2019-09-20 13:27:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-20 13:27:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 833 transitions. [2019-09-20 13:27:14,320 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 833 transitions. Word has length 83 [2019-09-20 13:27:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,320 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 833 transitions. [2019-09-20 13:27:14,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 833 transitions. [2019-09-20 13:27:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:14,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,322 INFO L407 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] [2019-09-20 13:27:14,323 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,323 INFO L82 PathProgramCache]: Analyzing trace with hash -20039148, now seen corresponding path program 1 times [2019-09-20 13:27:14,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-20 13:27:14,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:14,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:14,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:14,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:14,389 INFO L87 Difference]: Start difference. First operand 559 states and 833 transitions. Second operand 3 states. [2019-09-20 13:27:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,425 INFO L93 Difference]: Finished difference Result 708 states and 1058 transitions. [2019-09-20 13:27:14,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:14,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-20 13:27:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,430 INFO L225 Difference]: With dead ends: 708 [2019-09-20 13:27:14,430 INFO L226 Difference]: Without dead ends: 708 [2019-09-20 13:27:14,430 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-20 13:27:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-09-20 13:27:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-20 13:27:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1058 transitions. [2019-09-20 13:27:14,447 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1058 transitions. Word has length 83 [2019-09-20 13:27:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,448 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1058 transitions. [2019-09-20 13:27:14,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1058 transitions. [2019-09-20 13:27:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:14,450 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,451 INFO L407 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] [2019-09-20 13:27:14,451 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1988056367, now seen corresponding path program 1 times [2019-09-20 13:27:14,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:27:14,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:14,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:14,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:14,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:14,525 INFO L87 Difference]: Start difference. First operand 708 states and 1058 transitions. Second operand 3 states. [2019-09-20 13:27:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,565 INFO L93 Difference]: Finished difference Result 857 states and 1284 transitions. [2019-09-20 13:27:14,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:14,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:27:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,571 INFO L225 Difference]: With dead ends: 857 [2019-09-20 13:27:14,571 INFO L226 Difference]: Without dead ends: 857 [2019-09-20 13:27:14,571 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-20 13:27:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2019-09-20 13:27:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-20 13:27:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1284 transitions. [2019-09-20 13:27:14,595 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1284 transitions. Word has length 104 [2019-09-20 13:27:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,596 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1284 transitions. [2019-09-20 13:27:14,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1284 transitions. [2019-09-20 13:27:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:27:14,599 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,599 INFO L407 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] [2019-09-20 13:27:14,599 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash 282949015, now seen corresponding path program 1 times [2019-09-20 13:27:14,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:27:14,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,722 INFO L87 Difference]: Start difference. First operand 857 states and 1284 transitions. Second operand 4 states. [2019-09-20 13:27:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,018 INFO L93 Difference]: Finished difference Result 1035 states and 1546 transitions. [2019-09-20 13:27:15,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-20 13:27:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,024 INFO L225 Difference]: With dead ends: 1035 [2019-09-20 13:27:15,024 INFO L226 Difference]: Without dead ends: 1035 [2019-09-20 13:27:15,025 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-09-20 13:27:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 947. [2019-09-20 13:27:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-09-20 13:27:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1434 transitions. [2019-09-20 13:27:15,047 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1434 transitions. Word has length 120 [2019-09-20 13:27:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,048 INFO L475 AbstractCegarLoop]: Abstraction has 947 states and 1434 transitions. [2019-09-20 13:27:15,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1434 transitions. [2019-09-20 13:27:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-20 13:27:15,053 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,053 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:15,054 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2015996049, now seen corresponding path program 1 times [2019-09-20 13:27:15,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 103 proven. 23 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-20 13:27:15,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:27:15,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:27:15,183 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-20 13:27:15,185 INFO L207 CegarAbsIntRunner]: [0], [38], [39], [40], [43], [52], [63], [72], [74], [77], [79], [84], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [242], [244], [247], [251], [256], [271], [277], [282], [284], [287], [289], [292], [300], [305], [308], [311], [319], [324], [326], [328], [333], [336], [344], [346], [348], [351], [359], [364], [366], [369], [523], [557], [559], [571], [590], [596], [597], [598] [2019-09-20 13:27:15,242 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:27:15,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:27:15,331 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:27:15,332 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-20 13:27:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,337 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:27:15,391 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:27:15,391 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:27:15,397 INFO L420 sIntCurrentIteration]: We unified 133 AI predicates to 133 [2019-09-20 13:27:15,399 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:27:15,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:27:15,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-20 13:27:15,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:27:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:27:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:27:15,401 INFO L87 Difference]: Start difference. First operand 947 states and 1434 transitions. Second operand 2 states. [2019-09-20 13:27:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,405 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:27:15,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:27:15,405 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 134 [2019-09-20 13:27:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,406 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:27:15,406 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:27:15,406 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:27:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:27:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:27:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:27:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:27:15,407 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2019-09-20 13:27:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,407 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:27:15,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:27:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:27:15,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:27:15,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:15 BoogieIcfgContainer [2019-09-20 13:27:15,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:15,418 INFO L168 Benchmark]: Toolchain (without parser) took 10642.65 ms. Allocated memory was 133.2 MB in the beginning and 351.8 MB in the end (delta: 218.6 MB). Free memory was 86.9 MB in the beginning and 83.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 221.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:15,419 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 133.2 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:27:15,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 921.96 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 86.5 MB in the beginning and 158.1 MB in the end (delta: -71.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:15,425 INFO L168 Benchmark]: Boogie Preprocessor took 173.89 ms. Allocated memory is still 201.9 MB. Free memory was 158.1 MB in the beginning and 150.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:15,428 INFO L168 Benchmark]: RCFGBuilder took 1342.20 ms. Allocated memory was 201.9 MB in the beginning and 227.0 MB in the end (delta: 25.2 MB). Free memory was 150.5 MB in the beginning and 172.4 MB in the end (delta: -21.9 MB). Peak memory consumption was 80.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:15,428 INFO L168 Benchmark]: TraceAbstraction took 8196.77 ms. Allocated memory was 227.0 MB in the beginning and 351.8 MB in the end (delta: 124.8 MB). Free memory was 170.8 MB in the beginning and 83.7 MB in the end (delta: 87.2 MB). Peak memory consumption was 212.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:15,432 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 133.2 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 921.96 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 86.5 MB in the beginning and 158.1 MB in the end (delta: -71.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 173.89 ms. Allocated memory is still 201.9 MB. Free memory was 158.1 MB in the beginning and 150.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1342.20 ms. Allocated memory was 201.9 MB in the beginning and 227.0 MB in the end (delta: 25.2 MB). Free memory was 150.5 MB in the beginning and 172.4 MB in the end (delta: -21.9 MB). Peak memory consumption was 80.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8196.77 ms. Allocated memory was 227.0 MB in the beginning and 351.8 MB in the end (delta: 124.8 MB). Free memory was 170.8 MB in the beginning and 83.7 MB in the end (delta: 87.2 MB). Peak memory consumption was 212.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1644]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 167 locations, 1 error locations. SAFE Result, 8.1s OverallTime, 18 OverallIterations, 7 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3744 SDtfs, 1615 SDslu, 4596 SDs, 0 SdLazy, 2446 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 167 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=947occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.4360902255639099 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1199 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1411 NumberOfCodeBlocks, 1411 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1393 ConstructedInterpolants, 0 QuantifiedInterpolants, 272929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 1099/1122 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...