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/loops/s3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:02:54,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:02:54,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:02:54,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:02:54,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:02:54,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:02:54,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:02:54,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:02:54,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:02:54,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:02:54,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:02:54,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:02:54,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:02:54,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:02:54,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:02:54,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:02:54,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:02:54,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:02:54,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:02:54,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:02:54,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:02:54,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:02:54,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:02:54,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:02:54,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:02:54,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:02:54,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:02:54,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:02:54,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:02:54,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:02:54,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:02:54,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:02:54,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:02:54,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:02:54,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:02:54,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:02:54,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:02:54,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:02:54,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:02:54,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:02:54,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:02:54,945 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-16 17:02:54,960 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:02:54,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:02:54,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:02:54,961 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:02:54,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:02:54,962 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:02:54,962 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:02:54,962 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:02:54,962 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:02:54,963 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:02:54,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:02:54,963 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:02:54,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:02:54,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:02:54,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:02:54,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:02:54,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:02:54,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:02:54,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:02:54,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:02:54,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:02:54,965 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:02:54,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:02:54,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:02:54,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:02:54,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:02:54,967 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:02:54,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:02:54,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:02:54,967 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:02:54,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:02:55,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:02:55,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:02:55,012 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:02:55,012 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:02:55,013 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2019-09-16 17:02:55,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3056a79d4/96ebf76df73541c28619ca73b2de34ee/FLAG734f25f9d [2019-09-16 17:02:55,687 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:02:55,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2019-09-16 17:02:55,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3056a79d4/96ebf76df73541c28619ca73b2de34ee/FLAG734f25f9d [2019-09-16 17:02:55,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3056a79d4/96ebf76df73541c28619ca73b2de34ee [2019-09-16 17:02:55,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:02:55,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:02:55,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:02:55,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:02:55,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:02:55,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:02:55" (1/1) ... [2019-09-16 17:02:55,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e30681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:55, skipping insertion in model container [2019-09-16 17:02:55,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:02:55" (1/1) ... [2019-09-16 17:02:55,976 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:02:56,059 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:02:56,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:02:56,712 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:02:56,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:02:56,914 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:02:56,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56 WrapperNode [2019-09-16 17:02:56,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:02:56,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:02:56,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:02:56,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:02:56,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56" (1/1) ... [2019-09-16 17:02:56,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56" (1/1) ... [2019-09-16 17:02:56,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56" (1/1) ... [2019-09-16 17:02:56,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56" (1/1) ... [2019-09-16 17:02:57,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56" (1/1) ... [2019-09-16 17:02:57,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56" (1/1) ... [2019-09-16 17:02:57,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56" (1/1) ... [2019-09-16 17:02:57,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:02:57,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:02:57,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:02:57,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:02:57,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56" (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-16 17:02:57,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:02:57,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:02:57,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-16 17:02:57,146 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-16 17:02:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:02:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 17:02:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:02:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:02:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:02:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:02:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:02:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:02:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:02:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:02:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-16 17:02:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:02:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 17:02:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-16 17:02:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:02:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:02:57,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:02:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:02:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:02:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:02:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:02:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:02:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:02:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:02:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:02:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:02:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:02:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:02:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:02:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:02:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:02:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:02:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:02:57,657 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:02:58,277 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 17:02:58,277 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 17:02:58,295 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:02:58,296 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:02:58,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:02:58 BoogieIcfgContainer [2019-09-16 17:02:58,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:02:58,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:02:58,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:02:58,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:02:58,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:02:55" (1/3) ... [2019-09-16 17:02:58,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9559f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:02:58, skipping insertion in model container [2019-09-16 17:02:58,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:02:56" (2/3) ... [2019-09-16 17:02:58,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9559f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:02:58, skipping insertion in model container [2019-09-16 17:02:58,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:02:58" (3/3) ... [2019-09-16 17:02:58,307 INFO L109 eAbstractionObserver]: Analyzing ICFG s3.i [2019-09-16 17:02:58,318 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:02:58,328 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:02:58,347 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:02:58,378 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:02:58,378 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:02:58,378 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:02:58,378 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:02:58,378 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:02:58,379 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:02:58,379 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:02:58,379 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:02:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-16 17:02:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:02:58,421 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:02:58,422 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-16 17:02:58,425 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:02:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:02:58,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1412419194, now seen corresponding path program 1 times [2019-09-16 17:02:58,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:02:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:02:58,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:02:58,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:02:58,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:02:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:02:58,793 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-16 17:02:58,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:02:58,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:02:58,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:02:58,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:02:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:02:58,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:02:58,830 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-16 17:02:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:02:58,996 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2019-09-16 17:02:58,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:02:58,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:02:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:02:59,021 INFO L225 Difference]: With dead ends: 258 [2019-09-16 17:02:59,022 INFO L226 Difference]: Without dead ends: 223 [2019-09-16 17:02:59,027 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-16 17:02:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-16 17:02:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-16 17:02:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-16 17:02:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2019-09-16 17:02:59,124 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2019-09-16 17:02:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:02:59,125 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2019-09-16 17:02:59,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:02:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2019-09-16 17:02:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:02:59,135 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:02:59,135 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-16 17:02:59,135 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:02:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:02:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash -512814518, now seen corresponding path program 1 times [2019-09-16 17:02:59,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:02:59,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:02:59,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:02:59,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:02:59,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:02:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:02:59,321 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-16 17:02:59,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:02:59,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:02:59,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:02:59,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:02:59,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:02:59,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:02:59,324 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2019-09-16 17:02:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:02:59,382 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2019-09-16 17:02:59,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:02:59,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 17:02:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:02:59,386 INFO L225 Difference]: With dead ends: 325 [2019-09-16 17:02:59,386 INFO L226 Difference]: Without dead ends: 325 [2019-09-16 17:02:59,387 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-16 17:02:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-16 17:02:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-09-16 17:02:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-16 17:02:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2019-09-16 17:02:59,403 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2019-09-16 17:02:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:02:59,404 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2019-09-16 17:02:59,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:02:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2019-09-16 17:02:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:02:59,407 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:02:59,407 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-16 17:02:59,407 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:02:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:02:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1986020414, now seen corresponding path program 1 times [2019-09-16 17:02:59,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:02:59,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:02:59,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:02:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:02:59,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:02:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:02:59,581 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-16 17:02:59,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:02:59,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:02:59,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:02:59,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:02:59,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:02:59,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:02:59,584 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2019-09-16 17:03:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:00,166 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2019-09-16 17:03:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:00,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:03:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:00,171 INFO L225 Difference]: With dead ends: 513 [2019-09-16 17:03:00,171 INFO L226 Difference]: Without dead ends: 513 [2019-09-16 17:03:00,172 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-16 17:03:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-16 17:03:00,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2019-09-16 17:03:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-16 17:03:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2019-09-16 17:03:00,189 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2019-09-16 17:03:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:00,190 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2019-09-16 17:03:00,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2019-09-16 17:03:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:03:00,192 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:00,193 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-16 17:03:00,193 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2120033920, now seen corresponding path program 1 times [2019-09-16 17:03:00,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:00,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:00,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:00,416 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-16 17:03:00,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:00,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:00,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:00,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:00,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:00,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:00,419 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2019-09-16 17:03:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:00,783 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2019-09-16 17:03:00,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:00,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:03:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:00,787 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:03:00,787 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:03:00,787 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-16 17:03:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:03:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2019-09-16 17:03:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-16 17:03:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2019-09-16 17:03:00,806 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2019-09-16 17:03:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:00,806 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2019-09-16 17:03:00,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2019-09-16 17:03:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:03:00,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:00,810 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-16 17:03:00,810 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1441508551, now seen corresponding path program 1 times [2019-09-16 17:03:00,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:00,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:00,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:00,921 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-16 17:03:00,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:00,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:00,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:00,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:00,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:00,923 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2019-09-16 17:03:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:01,489 INFO L93 Difference]: Finished difference Result 547 states and 814 transitions. [2019-09-16 17:03:01,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:01,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:03:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:01,494 INFO L225 Difference]: With dead ends: 547 [2019-09-16 17:03:01,494 INFO L226 Difference]: Without dead ends: 547 [2019-09-16 17:03:01,495 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-16 17:03:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-16 17:03:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2019-09-16 17:03:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:03:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2019-09-16 17:03:01,510 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2019-09-16 17:03:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:01,511 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2019-09-16 17:03:01,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2019-09-16 17:03:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:03:01,514 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:01,514 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, 1] [2019-09-16 17:03:01,514 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:01,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1741349123, now seen corresponding path program 1 times [2019-09-16 17:03:01,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:01,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:01,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:01,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:01,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:01,659 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-16 17:03:01,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:01,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:01,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:01,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:01,661 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2019-09-16 17:03:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:02,135 INFO L93 Difference]: Finished difference Result 547 states and 812 transitions. [2019-09-16 17:03:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:02,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:03:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:02,144 INFO L225 Difference]: With dead ends: 547 [2019-09-16 17:03:02,144 INFO L226 Difference]: Without dead ends: 547 [2019-09-16 17:03:02,145 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-16 17:03:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-16 17:03:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2019-09-16 17:03:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:03:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2019-09-16 17:03:02,156 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2019-09-16 17:03:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:02,157 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2019-09-16 17:03:02,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2019-09-16 17:03:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:03:02,159 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:02,159 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, 1, 1] [2019-09-16 17:03:02,159 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:02,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1848274964, now seen corresponding path program 1 times [2019-09-16 17:03:02,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:02,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:02,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:02,238 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-16 17:03:02,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:02,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:02,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:02,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:02,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:02,240 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2019-09-16 17:03:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:02,706 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2019-09-16 17:03:02,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:02,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:03:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:02,710 INFO L225 Difference]: With dead ends: 537 [2019-09-16 17:03:02,710 INFO L226 Difference]: Without dead ends: 537 [2019-09-16 17:03:02,711 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-16 17:03:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-16 17:03:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2019-09-16 17:03:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2019-09-16 17:03:02,724 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2019-09-16 17:03:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:02,724 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2019-09-16 17:03:02,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2019-09-16 17:03:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:03:02,726 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:02,726 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, 1] [2019-09-16 17:03:02,727 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2132058447, now seen corresponding path program 1 times [2019-09-16 17:03:02,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:02,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:02,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:02,807 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-16 17:03:02,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:02,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:02,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:02,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:02,810 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2019-09-16 17:03:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:03,243 INFO L93 Difference]: Finished difference Result 535 states and 794 transitions. [2019-09-16 17:03:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:03,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:03:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:03,246 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:03:03,247 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:03:03,247 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-16 17:03:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:03:03,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-16 17:03:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2019-09-16 17:03:03,258 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2019-09-16 17:03:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:03,258 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2019-09-16 17:03:03,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2019-09-16 17:03:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:03:03,260 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:03,260 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, 1] [2019-09-16 17:03:03,261 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2113402989, now seen corresponding path program 1 times [2019-09-16 17:03:03,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:03,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:03,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:03,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:03,327 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-16 17:03:03,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:03,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:03,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:03,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:03,329 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2019-09-16 17:03:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:03,754 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2019-09-16 17:03:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:03,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:03:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:03,758 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:03:03,758 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:03:03,759 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-16 17:03:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:03:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-16 17:03:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-09-16 17:03:03,769 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2019-09-16 17:03:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:03,769 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-09-16 17:03:03,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-09-16 17:03:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:03:03,771 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:03,771 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] [2019-09-16 17:03:03,771 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1407902352, now seen corresponding path program 1 times [2019-09-16 17:03:03,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:03,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:03,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:03,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:03,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:03,834 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-16 17:03:03,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:03,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:03,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:03,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:03,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:03,836 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-09-16 17:03:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:04,275 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2019-09-16 17:03:04,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:04,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:03:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:04,279 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:03:04,279 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:03:04,280 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-16 17:03:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:03:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-16 17:03:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2019-09-16 17:03:04,290 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2019-09-16 17:03:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:04,290 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2019-09-16 17:03:04,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2019-09-16 17:03:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:03:04,292 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:04,292 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, 1] [2019-09-16 17:03:04,293 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash 286691281, now seen corresponding path program 1 times [2019-09-16 17:03:04,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:04,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:04,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:04,386 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-16 17:03:04,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:04,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:04,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:04,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:04,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:04,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:04,389 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2019-09-16 17:03:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:04,811 INFO L93 Difference]: Finished difference Result 463 states and 681 transitions. [2019-09-16 17:03:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:04,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:03:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:04,815 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:03:04,815 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:03:04,817 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-16 17:03:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:03:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-16 17:03:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2019-09-16 17:03:04,833 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2019-09-16 17:03:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:04,834 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2019-09-16 17:03:04,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2019-09-16 17:03:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:03:04,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:04,837 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, 1] [2019-09-16 17:03:04,837 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash 268035823, now seen corresponding path program 1 times [2019-09-16 17:03:04,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:04,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:04,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:04,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:04,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:04,945 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-16 17:03:04,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:04,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:04,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:04,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:04,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:04,947 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2019-09-16 17:03:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:05,234 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2019-09-16 17:03:05,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:05,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:03:05,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:05,238 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:03:05,238 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:03:05,239 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-16 17:03:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:03:05,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-16 17:03:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2019-09-16 17:03:05,254 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2019-09-16 17:03:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:05,255 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2019-09-16 17:03:05,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2019-09-16 17:03:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:03:05,257 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:05,258 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] [2019-09-16 17:03:05,258 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:05,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:05,259 INFO L82 PathProgramCache]: Analyzing trace with hash -437464814, now seen corresponding path program 1 times [2019-09-16 17:03:05,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:05,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:05,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:05,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:05,361 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-16 17:03:05,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:05,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:05,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:05,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:05,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:05,365 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2019-09-16 17:03:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:05,698 INFO L93 Difference]: Finished difference Result 463 states and 677 transitions. [2019-09-16 17:03:05,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:05,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:03:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:05,701 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:03:05,701 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:03:05,702 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-16 17:03:05,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:03:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-16 17:03:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2019-09-16 17:03:05,718 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2019-09-16 17:03:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:05,719 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2019-09-16 17:03:05,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2019-09-16 17:03:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:03:05,721 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:05,721 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, 1] [2019-09-16 17:03:05,721 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1076828074, now seen corresponding path program 1 times [2019-09-16 17:03:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:05,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:05,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:05,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:05,799 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-16 17:03:05,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:05,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:05,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:05,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:05,800 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2019-09-16 17:03:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:06,187 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2019-09-16 17:03:06,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:06,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:03:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:06,192 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:03:06,192 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:03:06,193 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-16 17:03:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:03:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-16 17:03:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-09-16 17:03:06,203 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2019-09-16 17:03:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:06,204 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-09-16 17:03:06,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-09-16 17:03:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:03:06,206 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:06,206 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:06,206 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash 979180473, now seen corresponding path program 1 times [2019-09-16 17:03:06,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:06,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:06,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:06,290 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-16 17:03:06,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:06,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:06,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:06,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:06,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:06,292 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-09-16 17:03:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:06,794 INFO L93 Difference]: Finished difference Result 529 states and 773 transitions. [2019-09-16 17:03:06,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:06,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:03:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:06,798 INFO L225 Difference]: With dead ends: 529 [2019-09-16 17:03:06,798 INFO L226 Difference]: Without dead ends: 529 [2019-09-16 17:03:06,798 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-16 17:03:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-16 17:03:06,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-16 17:03:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2019-09-16 17:03:06,809 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2019-09-16 17:03:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:06,809 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2019-09-16 17:03:06,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2019-09-16 17:03:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:03:06,811 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:06,811 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, 1] [2019-09-16 17:03:06,812 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:06,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1846331924, now seen corresponding path program 1 times [2019-09-16 17:03:06,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:06,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:06,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:06,873 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-16 17:03:06,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:06,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:06,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:06,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:06,875 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2019-09-16 17:03:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:07,157 INFO L93 Difference]: Finished difference Result 463 states and 671 transitions. [2019-09-16 17:03:07,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:07,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:03:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:07,161 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:03:07,161 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:03:07,161 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-16 17:03:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:03:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-16 17:03:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2019-09-16 17:03:07,171 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2019-09-16 17:03:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:07,172 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2019-09-16 17:03:07,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2019-09-16 17:03:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:03:07,173 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:07,173 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:07,174 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash -392626825, now seen corresponding path program 1 times [2019-09-16 17:03:07,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:07,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:07,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:07,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:07,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:07,231 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-16 17:03:07,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:07,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:07,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:07,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:07,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:07,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:07,233 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2019-09-16 17:03:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:07,527 INFO L93 Difference]: Finished difference Result 457 states and 662 transitions. [2019-09-16 17:03:07,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:07,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:03:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:07,530 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:03:07,530 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:03:07,531 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-16 17:03:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:03:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-16 17:03:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2019-09-16 17:03:07,541 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2019-09-16 17:03:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:07,541 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2019-09-16 17:03:07,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2019-09-16 17:03:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:03:07,543 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:07,543 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, 1] [2019-09-16 17:03:07,543 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash 564256466, now seen corresponding path program 1 times [2019-09-16 17:03:07,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:07,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:07,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:07,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:07,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:07,594 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-16 17:03:07,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:07,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:07,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:07,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:07,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:07,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:07,595 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2019-09-16 17:03:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:07,976 INFO L93 Difference]: Finished difference Result 529 states and 767 transitions. [2019-09-16 17:03:07,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:07,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:03:07,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:07,982 INFO L225 Difference]: With dead ends: 529 [2019-09-16 17:03:07,982 INFO L226 Difference]: Without dead ends: 529 [2019-09-16 17:03:07,982 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-16 17:03:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-16 17:03:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-16 17:03:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2019-09-16 17:03:07,995 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2019-09-16 17:03:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:07,996 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2019-09-16 17:03:07,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2019-09-16 17:03:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:03:08,000 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:08,000 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, 1] [2019-09-16 17:03:08,000 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash 987903188, now seen corresponding path program 1 times [2019-09-16 17:03:08,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:08,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:08,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:08,070 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-16 17:03:08,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:08,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:08,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:08,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:08,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:08,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:08,072 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2019-09-16 17:03:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:08,379 INFO L93 Difference]: Finished difference Result 457 states and 658 transitions. [2019-09-16 17:03:08,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:08,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:03:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:08,382 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:03:08,382 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:03:08,383 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-16 17:03:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:03:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-16 17:03:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2019-09-16 17:03:08,392 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2019-09-16 17:03:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:08,392 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2019-09-16 17:03:08,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2019-09-16 17:03:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:03:08,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:08,394 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:08,394 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:08,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:08,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1652269339, now seen corresponding path program 1 times [2019-09-16 17:03:08,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:08,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:08,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:08,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:08,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:03:08,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:08,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:08,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:08,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:08,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:08,454 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2019-09-16 17:03:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:08,828 INFO L93 Difference]: Finished difference Result 511 states and 741 transitions. [2019-09-16 17:03:08,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:08,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:03:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:08,831 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:03:08,831 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:03:08,832 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-16 17:03:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:03:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-16 17:03:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2019-09-16 17:03:08,841 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2019-09-16 17:03:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:08,841 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2019-09-16 17:03:08,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2019-09-16 17:03:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:03:08,843 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:08,843 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] [2019-09-16 17:03:08,843 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:08,843 INFO L82 PathProgramCache]: Analyzing trace with hash -39157652, now seen corresponding path program 1 times [2019-09-16 17:03:08,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:08,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:08,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:08,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:08,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:08,897 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-16 17:03:08,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:08,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:08,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:08,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:08,899 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2019-09-16 17:03:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:09,326 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2019-09-16 17:03:09,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:09,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:03:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:09,331 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:03:09,331 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:03:09,331 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-16 17:03:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:03:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-16 17:03:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2019-09-16 17:03:09,344 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2019-09-16 17:03:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:09,345 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2019-09-16 17:03:09,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2019-09-16 17:03:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:03:09,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:09,348 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:09,348 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:09,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1900415833, now seen corresponding path program 1 times [2019-09-16 17:03:09,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:09,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:09,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:03:09,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:09,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:09,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:09,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:09,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:09,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:09,434 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2019-09-16 17:03:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:09,684 INFO L93 Difference]: Finished difference Result 439 states and 630 transitions. [2019-09-16 17:03:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:09,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:03:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:09,688 INFO L225 Difference]: With dead ends: 439 [2019-09-16 17:03:09,688 INFO L226 Difference]: Without dead ends: 439 [2019-09-16 17:03:09,689 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-16 17:03:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-16 17:03:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2019-09-16 17:03:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:03:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2019-09-16 17:03:09,698 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2019-09-16 17:03:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:09,699 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2019-09-16 17:03:09,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2019-09-16 17:03:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:03:09,700 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:09,701 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] [2019-09-16 17:03:09,701 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:09,701 INFO L82 PathProgramCache]: Analyzing trace with hash 208988842, now seen corresponding path program 1 times [2019-09-16 17:03:09,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:09,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:09,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:09,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:09,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-16 17:03:09,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:09,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:03:09,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:09,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:03:09,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:03:09,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:09,763 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2019-09-16 17:03:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:09,793 INFO L93 Difference]: Finished difference Result 574 states and 827 transitions. [2019-09-16 17:03:09,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:03:09,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-16 17:03:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:09,797 INFO L225 Difference]: With dead ends: 574 [2019-09-16 17:03:09,797 INFO L226 Difference]: Without dead ends: 574 [2019-09-16 17:03:09,798 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-16 17:03:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-16 17:03:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-16 17:03:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-16 17:03:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2019-09-16 17:03:09,809 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2019-09-16 17:03:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:09,810 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2019-09-16 17:03:09,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:03:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2019-09-16 17:03:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:03:09,811 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:09,812 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-16 17:03:09,812 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1641385280, now seen corresponding path program 1 times [2019-09-16 17:03:09,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:09,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:09,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:09,897 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-16 17:03:09,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:09,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:03:09,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:09,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:03:09,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:03:09,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:09,901 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2019-09-16 17:03:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:09,930 INFO L93 Difference]: Finished difference Result 727 states and 1049 transitions. [2019-09-16 17:03:09,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:03:09,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-16 17:03:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:09,934 INFO L225 Difference]: With dead ends: 727 [2019-09-16 17:03:09,934 INFO L226 Difference]: Without dead ends: 727 [2019-09-16 17:03:09,937 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-16 17:03:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-16 17:03:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-16 17:03:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-16 17:03:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2019-09-16 17:03:09,951 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2019-09-16 17:03:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:09,951 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2019-09-16 17:03:09,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:03:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2019-09-16 17:03:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:03:09,953 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:09,954 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-16 17:03:09,954 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1283662913, now seen corresponding path program 1 times [2019-09-16 17:03:09,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:09,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:09,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:09,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:10,019 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-16 17:03:10,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:10,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:03:10,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:10,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:03:10,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:03:10,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:10,020 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2019-09-16 17:03:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:10,050 INFO L93 Difference]: Finished difference Result 724 states and 1039 transitions. [2019-09-16 17:03:10,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:03:10,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-16 17:03:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:10,054 INFO L225 Difference]: With dead ends: 724 [2019-09-16 17:03:10,054 INFO L226 Difference]: Without dead ends: 724 [2019-09-16 17:03:10,055 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-16 17:03:10,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-16 17:03:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-09-16 17:03:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-09-16 17:03:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1039 transitions. [2019-09-16 17:03:10,069 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1039 transitions. Word has length 104 [2019-09-16 17:03:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:10,069 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 1039 transitions. [2019-09-16 17:03:10,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:03:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1039 transitions. [2019-09-16 17:03:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:03:10,071 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:10,072 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, 1, 1] [2019-09-16 17:03:10,072 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash 803234748, now seen corresponding path program 1 times [2019-09-16 17:03:10,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:10,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:10,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:10,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:10,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:10,169 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-16 17:03:10,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:10,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:10,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:10,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:10,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:10,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:10,171 INFO L87 Difference]: Start difference. First operand 724 states and 1039 transitions. Second operand 4 states. [2019-09-16 17:03:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:10,494 INFO L93 Difference]: Finished difference Result 981 states and 1412 transitions. [2019-09-16 17:03:10,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:10,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:03:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:10,499 INFO L225 Difference]: With dead ends: 981 [2019-09-16 17:03:10,499 INFO L226 Difference]: Without dead ends: 981 [2019-09-16 17:03:10,500 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-16 17:03:10,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-16 17:03:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2019-09-16 17:03:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-16 17:03:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1249 transitions. [2019-09-16 17:03:10,518 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1249 transitions. Word has length 106 [2019-09-16 17:03:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:10,518 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1249 transitions. [2019-09-16 17:03:10,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1249 transitions. [2019-09-16 17:03:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:03:10,521 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:10,521 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:10,521 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:10,522 INFO L82 PathProgramCache]: Analyzing trace with hash -876635477, now seen corresponding path program 1 times [2019-09-16 17:03:10,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:10,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:10,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:03:10,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:10,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:10,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:10,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:10,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:10,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:10,615 INFO L87 Difference]: Start difference. First operand 844 states and 1249 transitions. Second operand 4 states. [2019-09-16 17:03:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:10,876 INFO L93 Difference]: Finished difference Result 976 states and 1402 transitions. [2019-09-16 17:03:10,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:10,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:03:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:10,881 INFO L225 Difference]: With dead ends: 976 [2019-09-16 17:03:10,881 INFO L226 Difference]: Without dead ends: 976 [2019-09-16 17:03:10,882 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-16 17:03:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-16 17:03:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-09-16 17:03:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-16 17:03:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1244 transitions. [2019-09-16 17:03:10,897 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1244 transitions. Word has length 121 [2019-09-16 17:03:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:10,898 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1244 transitions. [2019-09-16 17:03:10,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1244 transitions. [2019-09-16 17:03:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:03:10,900 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:10,900 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:10,901 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:10,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1624661431, now seen corresponding path program 1 times [2019-09-16 17:03:10,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:10,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:10,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:10,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:10,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:03:10,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:10,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:10,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:10,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:10,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:10,964 INFO L87 Difference]: Start difference. First operand 844 states and 1244 transitions. Second operand 4 states. [2019-09-16 17:03:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:11,269 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-09-16 17:03:11,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:11,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:03:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:11,277 INFO L225 Difference]: With dead ends: 976 [2019-09-16 17:03:11,277 INFO L226 Difference]: Without dead ends: 976 [2019-09-16 17:03:11,277 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-16 17:03:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-16 17:03:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-09-16 17:03:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-16 17:03:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1239 transitions. [2019-09-16 17:03:11,295 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1239 transitions. Word has length 121 [2019-09-16 17:03:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:11,296 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1239 transitions. [2019-09-16 17:03:11,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1239 transitions. [2019-09-16 17:03:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:03:11,299 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:11,299 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, 1] [2019-09-16 17:03:11,299 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1005940820, now seen corresponding path program 1 times [2019-09-16 17:03:11,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:11,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:11,415 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-16 17:03:11,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:11,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:11,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:11,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:11,418 INFO L87 Difference]: Start difference. First operand 844 states and 1239 transitions. Second operand 4 states. [2019-09-16 17:03:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:11,729 INFO L93 Difference]: Finished difference Result 982 states and 1440 transitions. [2019-09-16 17:03:11,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:11,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:03:11,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:11,734 INFO L225 Difference]: With dead ends: 982 [2019-09-16 17:03:11,734 INFO L226 Difference]: Without dead ends: 982 [2019-09-16 17:03:11,735 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-16 17:03:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-09-16 17:03:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2019-09-16 17:03:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-16 17:03:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1359 transitions. [2019-09-16 17:03:11,758 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1359 transitions. Word has length 121 [2019-09-16 17:03:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:11,758 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1359 transitions. [2019-09-16 17:03:11,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1359 transitions. [2019-09-16 17:03:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-16 17:03:11,761 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:11,761 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:11,761 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:11,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:11,762 INFO L82 PathProgramCache]: Analyzing trace with hash 908942672, now seen corresponding path program 1 times [2019-09-16 17:03:11,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:11,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:11,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:11,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:11,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:03:11,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:11,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:11,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:11,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:11,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:11,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:11,852 INFO L87 Difference]: Start difference. First operand 916 states and 1359 transitions. Second operand 4 states. [2019-09-16 17:03:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:12,193 INFO L93 Difference]: Finished difference Result 1048 states and 1512 transitions. [2019-09-16 17:03:12,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:12,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-16 17:03:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:12,199 INFO L225 Difference]: With dead ends: 1048 [2019-09-16 17:03:12,199 INFO L226 Difference]: Without dead ends: 1048 [2019-09-16 17:03:12,200 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-16 17:03:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-16 17:03:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-09-16 17:03:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-16 17:03:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1354 transitions. [2019-09-16 17:03:12,218 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1354 transitions. Word has length 122 [2019-09-16 17:03:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:12,219 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1354 transitions. [2019-09-16 17:03:12,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1354 transitions. [2019-09-16 17:03:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 17:03:12,222 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:12,222 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:12,222 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:12,223 INFO L82 PathProgramCache]: Analyzing trace with hash -187191506, now seen corresponding path program 1 times [2019-09-16 17:03:12,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:12,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:12,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:03:12,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:12,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:12,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:12,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:12,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:12,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:12,301 INFO L87 Difference]: Start difference. First operand 916 states and 1354 transitions. Second operand 4 states. [2019-09-16 17:03:12,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:12,585 INFO L93 Difference]: Finished difference Result 1048 states and 1507 transitions. [2019-09-16 17:03:12,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:12,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-16 17:03:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:12,591 INFO L225 Difference]: With dead ends: 1048 [2019-09-16 17:03:12,591 INFO L226 Difference]: Without dead ends: 1048 [2019-09-16 17:03:12,591 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-16 17:03:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-16 17:03:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-09-16 17:03:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-16 17:03:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1349 transitions. [2019-09-16 17:03:12,607 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1349 transitions. Word has length 123 [2019-09-16 17:03:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:12,607 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1349 transitions. [2019-09-16 17:03:12,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1349 transitions. [2019-09-16 17:03:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-16 17:03:12,610 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:12,610 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:12,611 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2136062699, now seen corresponding path program 1 times [2019-09-16 17:03:12,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:12,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:12,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:12,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:12,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:03:12,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:12,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:12,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:12,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:12,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:12,686 INFO L87 Difference]: Start difference. First operand 916 states and 1349 transitions. Second operand 4 states. [2019-09-16 17:03:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:12,942 INFO L93 Difference]: Finished difference Result 1003 states and 1447 transitions. [2019-09-16 17:03:12,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:12,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-16 17:03:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:12,947 INFO L225 Difference]: With dead ends: 1003 [2019-09-16 17:03:12,947 INFO L226 Difference]: Without dead ends: 1003 [2019-09-16 17:03:12,947 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-16 17:03:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-09-16 17:03:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2019-09-16 17:03:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-16 17:03:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1344 transitions. [2019-09-16 17:03:12,962 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1344 transitions. Word has length 124 [2019-09-16 17:03:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:12,962 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1344 transitions. [2019-09-16 17:03:12,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1344 transitions. [2019-09-16 17:03:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-16 17:03:12,965 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:12,965 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:12,966 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:12,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 195204134, now seen corresponding path program 1 times [2019-09-16 17:03:12,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:12,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:12,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:12,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:12,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-16 17:03:13,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:13,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:13,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:13,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:13,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:13,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:13,094 INFO L87 Difference]: Start difference. First operand 916 states and 1344 transitions. Second operand 4 states. [2019-09-16 17:03:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:13,383 INFO L93 Difference]: Finished difference Result 1148 states and 1682 transitions. [2019-09-16 17:03:13,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:13,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-16 17:03:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:13,387 INFO L225 Difference]: With dead ends: 1148 [2019-09-16 17:03:13,387 INFO L226 Difference]: Without dead ends: 1148 [2019-09-16 17:03:13,388 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-16 17:03:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-16 17:03:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2019-09-16 17:03:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-09-16 17:03:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1534 transitions. [2019-09-16 17:03:13,405 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1534 transitions. Word has length 124 [2019-09-16 17:03:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:13,406 INFO L475 AbstractCegarLoop]: Abstraction has 1026 states and 1534 transitions. [2019-09-16 17:03:13,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1534 transitions. [2019-09-16 17:03:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-16 17:03:13,409 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:13,409 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:13,409 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1476839352, now seen corresponding path program 1 times [2019-09-16 17:03:13,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:13,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:13,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-09-16 17:03:13,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:13,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:03:13,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:13,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:03:13,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:03:13,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:13,582 INFO L87 Difference]: Start difference. First operand 1026 states and 1534 transitions. Second operand 6 states. [2019-09-16 17:03:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:13,824 INFO L93 Difference]: Finished difference Result 1030 states and 1538 transitions. [2019-09-16 17:03:13,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:03:13,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-16 17:03:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:13,828 INFO L225 Difference]: With dead ends: 1030 [2019-09-16 17:03:13,828 INFO L226 Difference]: Without dead ends: 1030 [2019-09-16 17:03:13,828 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:03:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-16 17:03:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1029. [2019-09-16 17:03:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-09-16 17:03:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1537 transitions. [2019-09-16 17:03:13,845 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1537 transitions. Word has length 128 [2019-09-16 17:03:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:13,845 INFO L475 AbstractCegarLoop]: Abstraction has 1029 states and 1537 transitions. [2019-09-16 17:03:13,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:03:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1537 transitions. [2019-09-16 17:03:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-16 17:03:13,849 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:13,849 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:13,849 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:13,850 INFO L82 PathProgramCache]: Analyzing trace with hash -602359811, now seen corresponding path program 1 times [2019-09-16 17:03:13,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:13,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:13,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:03:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:03:14,595 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-16 17:03:14,670 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967302 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-16 17:03:14,671 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967301 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-16 17:03:14,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:03:14 BoogieIcfgContainer [2019-09-16 17:03:14,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:03:14,785 INFO L168 Benchmark]: Toolchain (without parser) took 18824.87 ms. Allocated memory was 139.5 MB in the beginning and 465.0 MB in the end (delta: 325.6 MB). Free memory was 83.8 MB in the beginning and 107.6 MB in the end (delta: -23.8 MB). Peak memory consumption was 301.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:14,788 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 104.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:03:14,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 958.51 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 83.6 MB in the beginning and 159.4 MB in the end (delta: -75.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:14,790 INFO L168 Benchmark]: Boogie Preprocessor took 157.28 ms. Allocated memory is still 201.3 MB. Free memory was 159.4 MB in the beginning and 151.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:14,791 INFO L168 Benchmark]: RCFGBuilder took 1223.78 ms. Allocated memory was 201.3 MB in the beginning and 224.9 MB in the end (delta: 23.6 MB). Free memory was 151.8 MB in the beginning and 177.5 MB in the end (delta: -25.7 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:14,791 INFO L168 Benchmark]: TraceAbstraction took 16480.16 ms. Allocated memory was 224.9 MB in the beginning and 465.0 MB in the end (delta: 240.1 MB). Free memory was 177.5 MB in the beginning and 107.6 MB in the end (delta: 69.9 MB). Peak memory consumption was 310.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:14,799 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.24 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 104.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 958.51 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 83.6 MB in the beginning and 159.4 MB in the end (delta: -75.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 157.28 ms. Allocated memory is still 201.3 MB. Free memory was 159.4 MB in the beginning and 151.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1223.78 ms. Allocated memory was 201.3 MB in the beginning and 224.9 MB in the end (delta: 23.6 MB). Free memory was 151.8 MB in the beginning and 177.5 MB in the end (delta: -25.7 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16480.16 ms. Allocated memory was 224.9 MB in the beginning and 465.0 MB in the end (delta: 240.1 MB). Free memory was 177.5 MB in the beginning and 107.6 MB in the end (delta: 69.9 MB). Peak memory consumption was 310.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967302 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967301 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; [L1040] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967352, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-6:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1071] CALL ssl3_connect(s) VAL [init=1, s={1:0}, SSLv3_client_data={-6:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->info_callback={6:-4294967301}, skip=0, SSLv3_client_data={-6:0}, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=12292, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1249] EXPR s->version VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->version=3, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->init_buf={4294967297:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=12292, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=0, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=-1, s={1:0}, s={1:0}, s->state=4368, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->bbio={2:-1}, s->wbio={2:1}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4368, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=1, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4384, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->hit=0, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] s->init_num = 0 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4384, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-4294967301}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4400, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={6:-4294967301}, ((s->s3)->tmp.new_cipher)->algorithms=4294967329, (s->s3)->tmp.new_cipher={4294967356:2}, blastFlag=2, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4400, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-4294967301}, blastFlag=3, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=10, s={1:0}, s={1:0}, s->state=4416, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4416, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=17, s={1:0}, s={1:0}, s->state=4432, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-4294967301}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->s3={-4:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4432, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=1, s={1:0}, s={1:0}, s->state=4448, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=2, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={6:-4294967301}, blastFlag=4, buf={4294967320:4294967324}, init=1, malloc(sizeof(int))={-3:0}, ret=2, s={1:0}, s={1:0}, skip=0, SSLv3_client_data={-6:0}, state=4448, tmp=0, tmp___0={-3:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 169 locations, 1 error locations. UNSAFE Result, 16.4s OverallTime, 35 OverallIterations, 7 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7566 SDtfs, 2657 SDslu, 9982 SDs, 0 SdLazy, 5228 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 68 SyntacticMatches, 22 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3084 NumberOfCodeBlocks, 3084 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2907 ConstructedInterpolants, 0 QuantifiedInterpolants, 612042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2666/2666 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...