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-c6af20d [2019-09-03 20:36:45,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:36:45,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:36:45,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:36:45,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:36:45,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:36:45,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:36:45,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:36:45,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:36:45,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:36:45,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:36:45,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:36:45,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:36:45,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:36:45,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:36:45,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:36:45,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:36:45,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:36:45,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:36:45,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:36:45,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:36:45,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:36:45,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:36:45,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:36:45,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:36:45,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:36:45,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:36:45,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:36:45,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:36:45,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:36:45,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:36:45,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:36:45,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:36:45,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:36:45,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:36:45,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:36:45,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:36:45,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:36:45,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:36:45,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:36:45,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:36:45,128 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-03 20:36:45,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:36:45,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:36:45,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:36:45,147 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:36:45,147 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:36:45,148 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:36:45,148 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:36:45,148 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:36:45,148 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:36:45,148 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:36:45,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:36:45,149 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:36:45,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:36:45,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:36:45,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:36:45,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:36:45,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:36:45,152 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:36:45,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:36:45,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:36:45,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:36:45,153 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:36:45,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:36:45,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:36:45,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:36:45,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:36:45,154 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:36:45,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:36:45,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:36:45,155 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:36:45,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:36:45,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:36:45,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:36:45,237 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:36:45,238 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:36:45,239 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2019-09-03 20:36:45,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42002fa25/f676425bf6724e2a87367a2a235d9617/FLAGed383164d [2019-09-03 20:36:45,945 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:36:45,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2019-09-03 20:36:45,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42002fa25/f676425bf6724e2a87367a2a235d9617/FLAGed383164d [2019-09-03 20:36:46,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42002fa25/f676425bf6724e2a87367a2a235d9617 [2019-09-03 20:36:46,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:36:46,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:36:46,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:46,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:36:46,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:36:46,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:46" (1/1) ... [2019-09-03 20:36:46,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270e4059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:46, skipping insertion in model container [2019-09-03 20:36:46,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:46" (1/1) ... [2019-09-03 20:36:46,194 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:36:46,272 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:36:46,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:46,937 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:36:47,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:47,141 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:36:47,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47 WrapperNode [2019-09-03 20:36:47,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:47,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:36:47,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:36:47,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:36:47,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47" (1/1) ... [2019-09-03 20:36:47,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47" (1/1) ... [2019-09-03 20:36:47,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47" (1/1) ... [2019-09-03 20:36:47,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47" (1/1) ... [2019-09-03 20:36:47,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47" (1/1) ... [2019-09-03 20:36:47,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47" (1/1) ... [2019-09-03 20:36:47,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47" (1/1) ... [2019-09-03 20:36:47,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:36:47,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:36:47,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:36:47,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:36:47,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47" (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-03 20:36:47,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:36:47,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:36:47,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-03 20:36:47,403 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-03 20:36:47,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:36:47,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-03 20:36:47,403 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-03 20:36:47,404 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-03 20:36:47,404 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-03 20:36:47,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:36:47,405 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-03 20:36:47,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:36:47,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-03 20:36:47,406 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-03 20:36:47,406 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-03 20:36:47,407 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-03 20:36:47,407 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-03 20:36:47,408 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-03 20:36:47,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-03 20:36:47,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-03 20:36:47,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:36:47,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-03 20:36:47,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 20:36:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-03 20:36:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 20:36:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-03 20:36:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-03 20:36:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:36:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 20:36:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-03 20:36:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-03 20:36:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:36:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-03 20:36:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-03 20:36:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-03 20:36:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-03 20:36:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 20:36:47,934 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-03 20:36:48,522 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-03 20:36:48,522 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-03 20:36:48,549 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:36:48,549 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:36:48,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:48 BoogieIcfgContainer [2019-09-03 20:36:48,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:36:48,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:36:48,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:36:48,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:36:48,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:36:46" (1/3) ... [2019-09-03 20:36:48,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca66af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:48, skipping insertion in model container [2019-09-03 20:36:48,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:47" (2/3) ... [2019-09-03 20:36:48,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca66af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:48, skipping insertion in model container [2019-09-03 20:36:48,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:48" (3/3) ... [2019-09-03 20:36:48,560 INFO L109 eAbstractionObserver]: Analyzing ICFG s3.i [2019-09-03 20:36:48,570 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:36:48,580 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:36:48,596 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:36:48,621 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:36:48,621 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:36:48,621 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:36:48,621 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:36:48,621 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:36:48,621 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:36:48,621 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:36:48,621 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:36:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-03 20:36:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:36:48,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:48,652 INFO L399 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-03 20:36:48,654 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1412419194, now seen corresponding path program 1 times [2019-09-03 20:36:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:48,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:48,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:49,039 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-03 20:36:49,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:49,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:36:49,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:49,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:36:49,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:36:49,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:36:49,070 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-03 20:36:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:49,154 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2019-09-03 20:36:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:36:49,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-03 20:36:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:49,170 INFO L225 Difference]: With dead ends: 258 [2019-09-03 20:36:49,171 INFO L226 Difference]: Without dead ends: 223 [2019-09-03 20:36:49,172 INFO L628 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-03 20:36:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-03 20:36:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-03 20:36:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 20:36:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2019-09-03 20:36:49,238 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2019-09-03 20:36:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:49,238 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2019-09-03 20:36:49,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:36:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2019-09-03 20:36:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:36:49,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:49,243 INFO L399 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-03 20:36:49,244 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:49,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:49,244 INFO L82 PathProgramCache]: Analyzing trace with hash -512814518, now seen corresponding path program 1 times [2019-09-03 20:36:49,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:49,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:49,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:49,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:49,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:49,385 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-03 20:36:49,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:49,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:36:49,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:49,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:36:49,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:36:49,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:36:49,389 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2019-09-03 20:36:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:49,458 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2019-09-03 20:36:49,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:36:49,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-03 20:36:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:49,462 INFO L225 Difference]: With dead ends: 325 [2019-09-03 20:36:49,462 INFO L226 Difference]: Without dead ends: 325 [2019-09-03 20:36:49,463 INFO L628 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-03 20:36:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-03 20:36:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-09-03 20:36:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-03 20:36:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2019-09-03 20:36:49,485 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2019-09-03 20:36:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:49,486 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2019-09-03 20:36:49,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:36:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2019-09-03 20:36:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-03 20:36:49,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:49,490 INFO L399 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-03 20:36:49,490 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:49,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1986020414, now seen corresponding path program 1 times [2019-09-03 20:36:49,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:49,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:49,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:49,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:49,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:49,609 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-03 20:36:49,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:49,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:49,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:49,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:49,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:49,611 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2019-09-03 20:36:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:50,148 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2019-09-03 20:36:50,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:50,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-03 20:36:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:50,152 INFO L225 Difference]: With dead ends: 513 [2019-09-03 20:36:50,152 INFO L226 Difference]: Without dead ends: 513 [2019-09-03 20:36:50,153 INFO L628 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-03 20:36:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-03 20:36:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2019-09-03 20:36:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-03 20:36:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2019-09-03 20:36:50,174 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2019-09-03 20:36:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:50,175 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2019-09-03 20:36:50,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2019-09-03 20:36:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-03 20:36:50,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:50,179 INFO L399 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-03 20:36:50,179 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2120033920, now seen corresponding path program 1 times [2019-09-03 20:36:50,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:50,258 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-03 20:36:50,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:50,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:50,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:50,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:50,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:50,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:50,260 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2019-09-03 20:36:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:50,563 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2019-09-03 20:36:50,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:50,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-03 20:36:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:50,569 INFO L225 Difference]: With dead ends: 459 [2019-09-03 20:36:50,569 INFO L226 Difference]: Without dead ends: 459 [2019-09-03 20:36:50,570 INFO L628 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-03 20:36:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-03 20:36:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2019-09-03 20:36:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-03 20:36:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2019-09-03 20:36:50,594 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2019-09-03 20:36:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:50,597 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2019-09-03 20:36:50,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2019-09-03 20:36:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:36:50,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:50,609 INFO L399 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-03 20:36:50,610 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1441508551, now seen corresponding path program 1 times [2019-09-03 20:36:50,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:50,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:50,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:50,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:50,725 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-03 20:36:50,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:50,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:50,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:50,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:50,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:50,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:50,727 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2019-09-03 20:36:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:51,167 INFO L93 Difference]: Finished difference Result 547 states and 814 transitions. [2019-09-03 20:36:51,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:51,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-03 20:36:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:51,172 INFO L225 Difference]: With dead ends: 547 [2019-09-03 20:36:51,172 INFO L226 Difference]: Without dead ends: 547 [2019-09-03 20:36:51,172 INFO L628 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-03 20:36:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-03 20:36:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2019-09-03 20:36:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-03 20:36:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2019-09-03 20:36:51,184 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2019-09-03 20:36:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:51,184 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2019-09-03 20:36:51,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2019-09-03 20:36:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 20:36:51,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:51,186 INFO L399 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-03 20:36:51,186 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1741349123, now seen corresponding path program 1 times [2019-09-03 20:36:51,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:51,309 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-03 20:36:51,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:51,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:51,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:51,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:51,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:51,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:51,311 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2019-09-03 20:36:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:51,755 INFO L93 Difference]: Finished difference Result 547 states and 812 transitions. [2019-09-03 20:36:51,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:51,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-03 20:36:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:51,766 INFO L225 Difference]: With dead ends: 547 [2019-09-03 20:36:51,766 INFO L226 Difference]: Without dead ends: 547 [2019-09-03 20:36:51,766 INFO L628 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-03 20:36:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-03 20:36:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2019-09-03 20:36:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-03 20:36:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2019-09-03 20:36:51,777 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2019-09-03 20:36:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:51,778 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2019-09-03 20:36:51,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2019-09-03 20:36:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:36:51,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:51,780 INFO L399 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-03 20:36:51,780 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1848274964, now seen corresponding path program 1 times [2019-09-03 20:36:51,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:51,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:51,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:51,846 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-03 20:36:51,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:51,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:51,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:51,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:51,848 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2019-09-03 20:36:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:52,268 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2019-09-03 20:36:52,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:52,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-03 20:36:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:52,276 INFO L225 Difference]: With dead ends: 537 [2019-09-03 20:36:52,276 INFO L226 Difference]: Without dead ends: 537 [2019-09-03 20:36:52,277 INFO L628 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-03 20:36:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-03 20:36:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2019-09-03 20:36:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2019-09-03 20:36:52,287 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2019-09-03 20:36:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:52,287 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2019-09-03 20:36:52,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2019-09-03 20:36:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:36:52,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:52,289 INFO L399 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-03 20:36:52,289 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2132058447, now seen corresponding path program 1 times [2019-09-03 20:36:52,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:52,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:52,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,384 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-03 20:36:52,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:52,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:52,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:52,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:52,387 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2019-09-03 20:36:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:52,816 INFO L93 Difference]: Finished difference Result 535 states and 794 transitions. [2019-09-03 20:36:52,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:52,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-03 20:36:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:52,821 INFO L225 Difference]: With dead ends: 535 [2019-09-03 20:36:52,821 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 20:36:52,822 INFO L628 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-03 20:36:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 20:36:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-03 20:36:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2019-09-03 20:36:52,837 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2019-09-03 20:36:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:52,838 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2019-09-03 20:36:52,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2019-09-03 20:36:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:36:52,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:52,841 INFO L399 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-03 20:36:52,841 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:52,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:52,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2113402989, now seen corresponding path program 1 times [2019-09-03 20:36:52,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:52,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,974 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-03 20:36:52,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:52,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:52,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:52,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:52,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:52,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:52,977 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2019-09-03 20:36:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,412 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2019-09-03 20:36:53,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:53,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-03 20:36:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,417 INFO L225 Difference]: With dead ends: 535 [2019-09-03 20:36:53,417 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 20:36:53,418 INFO L628 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-03 20:36:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 20:36:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-03 20:36:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-09-03 20:36:53,428 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2019-09-03 20:36:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,428 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-09-03 20:36:53,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-09-03 20:36:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:36:53,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,430 INFO L399 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-03 20:36:53,430 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1407902352, now seen corresponding path program 1 times [2019-09-03 20:36:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,495 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-03 20:36:53,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:53,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:53,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:53,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:53,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:53,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:53,497 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-09-03 20:36:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,952 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2019-09-03 20:36:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:53,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-03 20:36:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,956 INFO L225 Difference]: With dead ends: 535 [2019-09-03 20:36:53,956 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 20:36:53,957 INFO L628 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-03 20:36:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 20:36:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-03 20:36:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2019-09-03 20:36:53,967 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2019-09-03 20:36:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,968 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2019-09-03 20:36:53,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2019-09-03 20:36:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:36:53,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,970 INFO L399 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-03 20:36:53,970 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,970 INFO L82 PathProgramCache]: Analyzing trace with hash 286691281, now seen corresponding path program 1 times [2019-09-03 20:36:53,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,055 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-03 20:36:54,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:54,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:54,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:54,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:54,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:54,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:54,057 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2019-09-03 20:36:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:54,439 INFO L93 Difference]: Finished difference Result 463 states and 681 transitions. [2019-09-03 20:36:54,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:54,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-03 20:36:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,442 INFO L225 Difference]: With dead ends: 463 [2019-09-03 20:36:54,442 INFO L226 Difference]: Without dead ends: 463 [2019-09-03 20:36:54,443 INFO L628 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-03 20:36:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-03 20:36:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-03 20:36:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2019-09-03 20:36:54,454 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2019-09-03 20:36:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,455 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2019-09-03 20:36:54,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2019-09-03 20:36:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:36:54,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,457 INFO L399 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-03 20:36:54,457 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash 268035823, now seen corresponding path program 1 times [2019-09-03 20:36:54,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,530 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-03 20:36:54,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:54,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:54,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:54,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:54,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:54,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:54,532 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2019-09-03 20:36:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:54,831 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2019-09-03 20:36:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:54,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-03 20:36:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,834 INFO L225 Difference]: With dead ends: 463 [2019-09-03 20:36:54,834 INFO L226 Difference]: Without dead ends: 463 [2019-09-03 20:36:54,834 INFO L628 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-03 20:36:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-03 20:36:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-03 20:36:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2019-09-03 20:36:54,846 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2019-09-03 20:36:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,847 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2019-09-03 20:36:54,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2019-09-03 20:36:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:36:54,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,849 INFO L399 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-03 20:36:54,849 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,850 INFO L82 PathProgramCache]: Analyzing trace with hash -437464814, now seen corresponding path program 1 times [2019-09-03 20:36:54,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:54,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,989 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-03 20:36:54,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:54,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:54,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:54,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:54,992 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2019-09-03 20:36:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:55,277 INFO L93 Difference]: Finished difference Result 463 states and 677 transitions. [2019-09-03 20:36:55,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:55,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-03 20:36:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:55,280 INFO L225 Difference]: With dead ends: 463 [2019-09-03 20:36:55,280 INFO L226 Difference]: Without dead ends: 463 [2019-09-03 20:36:55,280 INFO L628 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-03 20:36:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-03 20:36:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-03 20:36:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2019-09-03 20:36:55,289 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2019-09-03 20:36:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:55,289 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2019-09-03 20:36:55,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2019-09-03 20:36:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 20:36:55,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:55,291 INFO L399 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-03 20:36:55,291 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1076828074, now seen corresponding path program 1 times [2019-09-03 20:36:55,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:55,348 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-03 20:36:55,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:55,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:55,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:55,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:55,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:55,350 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2019-09-03 20:36:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:55,739 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2019-09-03 20:36:55,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:55,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-03 20:36:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:55,743 INFO L225 Difference]: With dead ends: 535 [2019-09-03 20:36:55,743 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 20:36:55,743 INFO L628 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-03 20:36:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 20:36:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-03 20:36:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-09-03 20:36:55,753 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2019-09-03 20:36:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:55,753 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-09-03 20:36:55,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-09-03 20:36:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 20:36:55,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:55,755 INFO L399 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-03 20:36:55,755 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash 979180473, now seen corresponding path program 1 times [2019-09-03 20:36:55,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:55,824 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-03 20:36:55,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:55,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:55,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:55,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:55,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:55,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:55,825 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-09-03 20:36:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:56,208 INFO L93 Difference]: Finished difference Result 529 states and 773 transitions. [2019-09-03 20:36:56,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:56,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-03 20:36:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:56,211 INFO L225 Difference]: With dead ends: 529 [2019-09-03 20:36:56,211 INFO L226 Difference]: Without dead ends: 529 [2019-09-03 20:36:56,211 INFO L628 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-03 20:36:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-03 20:36:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-03 20:36:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2019-09-03 20:36:56,220 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2019-09-03 20:36:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:56,221 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2019-09-03 20:36:56,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2019-09-03 20:36:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 20:36:56,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:56,223 INFO L399 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-03 20:36:56,223 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:56,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1846331924, now seen corresponding path program 1 times [2019-09-03 20:36:56,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:56,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:56,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:56,271 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-03 20:36:56,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:56,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:56,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:56,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:56,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:56,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:56,272 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2019-09-03 20:36:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:56,511 INFO L93 Difference]: Finished difference Result 463 states and 671 transitions. [2019-09-03 20:36:56,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:56,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-03 20:36:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:56,517 INFO L225 Difference]: With dead ends: 463 [2019-09-03 20:36:56,518 INFO L226 Difference]: Without dead ends: 463 [2019-09-03 20:36:56,518 INFO L628 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-03 20:36:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-03 20:36:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-03 20:36:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2019-09-03 20:36:56,530 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2019-09-03 20:36:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:56,530 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2019-09-03 20:36:56,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2019-09-03 20:36:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 20:36:56,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:56,532 INFO L399 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-03 20:36:56,532 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:56,532 INFO L82 PathProgramCache]: Analyzing trace with hash -392626825, now seen corresponding path program 1 times [2019-09-03 20:36:56,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:56,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:56,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:56,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:56,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:56,598 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-03 20:36:56,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:56,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:56,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:56,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:56,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:56,599 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2019-09-03 20:36:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:56,849 INFO L93 Difference]: Finished difference Result 457 states and 662 transitions. [2019-09-03 20:36:56,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:56,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-03 20:36:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:56,852 INFO L225 Difference]: With dead ends: 457 [2019-09-03 20:36:56,852 INFO L226 Difference]: Without dead ends: 457 [2019-09-03 20:36:56,853 INFO L628 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-03 20:36:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-03 20:36:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-03 20:36:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2019-09-03 20:36:56,863 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2019-09-03 20:36:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:56,863 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2019-09-03 20:36:56,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2019-09-03 20:36:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:36:56,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:56,865 INFO L399 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-03 20:36:56,865 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 564256466, now seen corresponding path program 1 times [2019-09-03 20:36:56,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:56,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:56,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:56,917 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-03 20:36:56,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:56,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:56,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:56,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:56,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:56,919 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2019-09-03 20:36:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:57,289 INFO L93 Difference]: Finished difference Result 529 states and 767 transitions. [2019-09-03 20:36:57,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:57,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-03 20:36:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:57,294 INFO L225 Difference]: With dead ends: 529 [2019-09-03 20:36:57,294 INFO L226 Difference]: Without dead ends: 529 [2019-09-03 20:36:57,295 INFO L628 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-03 20:36:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-03 20:36:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-03 20:36:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2019-09-03 20:36:57,303 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2019-09-03 20:36:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:57,304 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2019-09-03 20:36:57,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2019-09-03 20:36:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:36:57,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:57,305 INFO L399 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-03 20:36:57,306 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:57,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:57,306 INFO L82 PathProgramCache]: Analyzing trace with hash 987903188, now seen corresponding path program 1 times [2019-09-03 20:36:57,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:57,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:57,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:57,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:57,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:57,360 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-03 20:36:57,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:57,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:57,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:57,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:57,362 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2019-09-03 20:36:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:57,608 INFO L93 Difference]: Finished difference Result 457 states and 658 transitions. [2019-09-03 20:36:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:57,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-03 20:36:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:57,612 INFO L225 Difference]: With dead ends: 457 [2019-09-03 20:36:57,613 INFO L226 Difference]: Without dead ends: 457 [2019-09-03 20:36:57,613 INFO L628 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-03 20:36:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-03 20:36:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-03 20:36:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2019-09-03 20:36:57,621 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2019-09-03 20:36:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:57,622 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2019-09-03 20:36:57,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2019-09-03 20:36:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 20:36:57,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:57,624 INFO L399 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-03 20:36:57,624 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1652269339, now seen corresponding path program 1 times [2019-09-03 20:36:57,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:57,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:57,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:57,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:57,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:57,686 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-03 20:36:57,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:57,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:57,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:57,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:57,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:57,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:57,688 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2019-09-03 20:36:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:58,012 INFO L93 Difference]: Finished difference Result 511 states and 741 transitions. [2019-09-03 20:36:58,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:58,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-03 20:36:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:58,016 INFO L225 Difference]: With dead ends: 511 [2019-09-03 20:36:58,016 INFO L226 Difference]: Without dead ends: 511 [2019-09-03 20:36:58,016 INFO L628 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-03 20:36:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-03 20:36:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-03 20:36:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2019-09-03 20:36:58,023 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2019-09-03 20:36:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:58,024 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2019-09-03 20:36:58,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2019-09-03 20:36:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 20:36:58,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:58,026 INFO L399 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-03 20:36:58,026 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash -39157652, now seen corresponding path program 1 times [2019-09-03 20:36:58,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:58,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:58,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:58,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:58,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:58,081 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-03 20:36:58,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:58,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:58,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:58,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:58,083 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2019-09-03 20:36:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:58,527 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2019-09-03 20:36:58,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:58,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-03 20:36:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:58,531 INFO L225 Difference]: With dead ends: 511 [2019-09-03 20:36:58,531 INFO L226 Difference]: Without dead ends: 511 [2019-09-03 20:36:58,532 INFO L628 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-03 20:36:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-03 20:36:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-03 20:36:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2019-09-03 20:36:58,545 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2019-09-03 20:36:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:58,546 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2019-09-03 20:36:58,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2019-09-03 20:36:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 20:36:58,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:58,548 INFO L399 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-03 20:36:58,549 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:58,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1900415833, now seen corresponding path program 1 times [2019-09-03 20:36:58,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:58,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:58,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:58,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:58,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:58,640 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-03 20:36:58,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:58,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:58,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:58,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:58,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:58,642 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2019-09-03 20:36:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:58,925 INFO L93 Difference]: Finished difference Result 439 states and 630 transitions. [2019-09-03 20:36:58,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:58,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-03 20:36:58,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:58,929 INFO L225 Difference]: With dead ends: 439 [2019-09-03 20:36:58,929 INFO L226 Difference]: Without dead ends: 439 [2019-09-03 20:36:58,930 INFO L628 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-03 20:36:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-03 20:36:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2019-09-03 20:36:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-03 20:36:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2019-09-03 20:36:58,938 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2019-09-03 20:36:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:58,939 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2019-09-03 20:36:58,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2019-09-03 20:36:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 20:36:58,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:58,941 INFO L399 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-03 20:36:58,942 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:58,942 INFO L82 PathProgramCache]: Analyzing trace with hash 208988842, now seen corresponding path program 1 times [2019-09-03 20:36:58,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:58,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:58,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:58,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:58,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:58,992 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-03 20:36:58,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:58,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:36:58,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:58,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:36:58,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:36:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:36:58,994 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2019-09-03 20:36:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:59,024 INFO L93 Difference]: Finished difference Result 574 states and 827 transitions. [2019-09-03 20:36:59,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:36:59,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-03 20:36:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:59,027 INFO L225 Difference]: With dead ends: 574 [2019-09-03 20:36:59,027 INFO L226 Difference]: Without dead ends: 574 [2019-09-03 20:36:59,028 INFO L628 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-03 20:36:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-03 20:36:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-03 20:36:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-03 20:36:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2019-09-03 20:36:59,037 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2019-09-03 20:36:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:59,037 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2019-09-03 20:36:59,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:36:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2019-09-03 20:36:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 20:36:59,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:59,040 INFO L399 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-03 20:36:59,040 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1641385280, now seen corresponding path program 1 times [2019-09-03 20:36:59,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:59,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:59,084 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-03 20:36:59,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:59,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:36:59,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:59,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:36:59,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:36:59,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:36:59,086 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2019-09-03 20:36:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:59,149 INFO L93 Difference]: Finished difference Result 727 states and 1049 transitions. [2019-09-03 20:36:59,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:36:59,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-03 20:36:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:59,154 INFO L225 Difference]: With dead ends: 727 [2019-09-03 20:36:59,154 INFO L226 Difference]: Without dead ends: 727 [2019-09-03 20:36:59,158 INFO L628 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-03 20:36:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-03 20:36:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-03 20:36:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-03 20:36:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2019-09-03 20:36:59,178 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2019-09-03 20:36:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:59,178 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2019-09-03 20:36:59,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:36:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2019-09-03 20:36:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:36:59,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:59,182 INFO L399 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-03 20:36:59,182 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1283662913, now seen corresponding path program 1 times [2019-09-03 20:36:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:59,261 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-03 20:36:59,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:59,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:36:59,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:59,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:36:59,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:36:59,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:36:59,263 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2019-09-03 20:36:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:59,311 INFO L93 Difference]: Finished difference Result 724 states and 1039 transitions. [2019-09-03 20:36:59,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:36:59,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-03 20:36:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:59,315 INFO L225 Difference]: With dead ends: 724 [2019-09-03 20:36:59,315 INFO L226 Difference]: Without dead ends: 724 [2019-09-03 20:36:59,316 INFO L628 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-03 20:36:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-03 20:36:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-09-03 20:36:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-09-03 20:36:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1039 transitions. [2019-09-03 20:36:59,328 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1039 transitions. Word has length 104 [2019-09-03 20:36:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:59,328 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 1039 transitions. [2019-09-03 20:36:59,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:36:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1039 transitions. [2019-09-03 20:36:59,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 20:36:59,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:59,331 INFO L399 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-03 20:36:59,331 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:59,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:59,332 INFO L82 PathProgramCache]: Analyzing trace with hash 803234748, now seen corresponding path program 1 times [2019-09-03 20:36:59,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:59,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:59,414 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-03 20:36:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:59,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:59,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:59,416 INFO L87 Difference]: Start difference. First operand 724 states and 1039 transitions. Second operand 4 states. [2019-09-03 20:36:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:59,701 INFO L93 Difference]: Finished difference Result 981 states and 1412 transitions. [2019-09-03 20:36:59,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:59,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-03 20:36:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:59,705 INFO L225 Difference]: With dead ends: 981 [2019-09-03 20:36:59,706 INFO L226 Difference]: Without dead ends: 981 [2019-09-03 20:36:59,706 INFO L628 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-03 20:36:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-03 20:36:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2019-09-03 20:36:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-03 20:36:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1249 transitions. [2019-09-03 20:36:59,721 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1249 transitions. Word has length 106 [2019-09-03 20:36:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:59,721 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1249 transitions. [2019-09-03 20:36:59,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1249 transitions. [2019-09-03 20:36:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 20:36:59,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:59,724 INFO L399 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-03 20:36:59,725 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash -876635477, now seen corresponding path program 1 times [2019-09-03 20:36:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:59,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:59,796 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-03 20:36:59,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:59,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:36:59,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:59,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:59,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:59,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:36:59,798 INFO L87 Difference]: Start difference. First operand 844 states and 1249 transitions. Second operand 4 states. [2019-09-03 20:37:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:00,096 INFO L93 Difference]: Finished difference Result 976 states and 1402 transitions. [2019-09-03 20:37:00,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:37:00,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-03 20:37:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:00,101 INFO L225 Difference]: With dead ends: 976 [2019-09-03 20:37:00,101 INFO L226 Difference]: Without dead ends: 976 [2019-09-03 20:37:00,101 INFO L628 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-03 20:37:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-03 20:37:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-09-03 20:37:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-03 20:37:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1244 transitions. [2019-09-03 20:37:00,119 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1244 transitions. Word has length 121 [2019-09-03 20:37:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:00,120 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1244 transitions. [2019-09-03 20:37:00,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:37:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1244 transitions. [2019-09-03 20:37:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 20:37:00,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:00,123 INFO L399 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-03 20:37:00,123 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:00,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1624661431, now seen corresponding path program 1 times [2019-09-03 20:37:00,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:00,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:00,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:00,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:00,202 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-03 20:37:00,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:00,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:37:00,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:00,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:37:00,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:37:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:37:00,204 INFO L87 Difference]: Start difference. First operand 844 states and 1244 transitions. Second operand 4 states. [2019-09-03 20:37:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:00,504 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-09-03 20:37:00,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:37:00,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-03 20:37:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:00,508 INFO L225 Difference]: With dead ends: 976 [2019-09-03 20:37:00,508 INFO L226 Difference]: Without dead ends: 976 [2019-09-03 20:37:00,509 INFO L628 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-03 20:37:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-03 20:37:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-09-03 20:37:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-03 20:37:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1239 transitions. [2019-09-03 20:37:00,523 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1239 transitions. Word has length 121 [2019-09-03 20:37:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:00,523 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1239 transitions. [2019-09-03 20:37:00,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:37:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1239 transitions. [2019-09-03 20:37:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 20:37:00,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:00,526 INFO L399 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-03 20:37:00,526 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:00,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1005940820, now seen corresponding path program 1 times [2019-09-03 20:37:00,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:00,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:00,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:00,604 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-03 20:37:00,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:00,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:37:00,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:00,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:37:00,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:37:00,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:37:00,606 INFO L87 Difference]: Start difference. First operand 844 states and 1239 transitions. Second operand 4 states. [2019-09-03 20:37:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:00,867 INFO L93 Difference]: Finished difference Result 982 states and 1440 transitions. [2019-09-03 20:37:00,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:37:00,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-03 20:37:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:00,872 INFO L225 Difference]: With dead ends: 982 [2019-09-03 20:37:00,872 INFO L226 Difference]: Without dead ends: 982 [2019-09-03 20:37:00,873 INFO L628 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-03 20:37:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-09-03 20:37:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2019-09-03 20:37:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-03 20:37:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1359 transitions. [2019-09-03 20:37:00,889 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1359 transitions. Word has length 121 [2019-09-03 20:37:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:00,889 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1359 transitions. [2019-09-03 20:37:00,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:37:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1359 transitions. [2019-09-03 20:37:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-03 20:37:00,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:00,892 INFO L399 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-03 20:37:00,893 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:00,893 INFO L82 PathProgramCache]: Analyzing trace with hash 908942672, now seen corresponding path program 1 times [2019-09-03 20:37:00,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:00,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:00,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:00,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:00,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:00,956 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-03 20:37:00,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:00,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:37:00,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:00,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:37:00,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:37:00,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:37:00,958 INFO L87 Difference]: Start difference. First operand 916 states and 1359 transitions. Second operand 4 states. [2019-09-03 20:37:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:01,243 INFO L93 Difference]: Finished difference Result 1048 states and 1512 transitions. [2019-09-03 20:37:01,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:37:01,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-03 20:37:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:01,247 INFO L225 Difference]: With dead ends: 1048 [2019-09-03 20:37:01,248 INFO L226 Difference]: Without dead ends: 1048 [2019-09-03 20:37:01,248 INFO L628 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-03 20:37:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-03 20:37:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-09-03 20:37:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-03 20:37:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1354 transitions. [2019-09-03 20:37:01,262 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1354 transitions. Word has length 122 [2019-09-03 20:37:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:01,263 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1354 transitions. [2019-09-03 20:37:01,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:37:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1354 transitions. [2019-09-03 20:37:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-03 20:37:01,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:01,266 INFO L399 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-03 20:37:01,266 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:01,266 INFO L82 PathProgramCache]: Analyzing trace with hash -187191506, now seen corresponding path program 1 times [2019-09-03 20:37:01,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:01,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:01,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:01,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:01,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:01,343 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-03 20:37:01,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:01,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:37:01,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:01,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:37:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:37:01,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:37:01,345 INFO L87 Difference]: Start difference. First operand 916 states and 1354 transitions. Second operand 4 states. [2019-09-03 20:37:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:01,630 INFO L93 Difference]: Finished difference Result 1048 states and 1507 transitions. [2019-09-03 20:37:01,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:37:01,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-03 20:37:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:01,634 INFO L225 Difference]: With dead ends: 1048 [2019-09-03 20:37:01,634 INFO L226 Difference]: Without dead ends: 1048 [2019-09-03 20:37:01,635 INFO L628 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-03 20:37:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-03 20:37:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-09-03 20:37:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-03 20:37:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1349 transitions. [2019-09-03 20:37:01,648 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1349 transitions. Word has length 123 [2019-09-03 20:37:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:01,648 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1349 transitions. [2019-09-03 20:37:01,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:37:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1349 transitions. [2019-09-03 20:37:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 20:37:01,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:01,651 INFO L399 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-03 20:37:01,651 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:01,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2136062699, now seen corresponding path program 1 times [2019-09-03 20:37:01,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:01,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:01,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:01,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:01,717 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-03 20:37:01,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:01,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:37:01,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:01,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:37:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:37:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:37:01,719 INFO L87 Difference]: Start difference. First operand 916 states and 1349 transitions. Second operand 4 states. [2019-09-03 20:37:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:01,970 INFO L93 Difference]: Finished difference Result 1003 states and 1447 transitions. [2019-09-03 20:37:01,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:37:01,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-03 20:37:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:01,977 INFO L225 Difference]: With dead ends: 1003 [2019-09-03 20:37:01,977 INFO L226 Difference]: Without dead ends: 1003 [2019-09-03 20:37:01,977 INFO L628 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-03 20:37:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-09-03 20:37:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2019-09-03 20:37:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-03 20:37:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1344 transitions. [2019-09-03 20:37:01,987 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1344 transitions. Word has length 124 [2019-09-03 20:37:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:01,987 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1344 transitions. [2019-09-03 20:37:01,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:37:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1344 transitions. [2019-09-03 20:37:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 20:37:01,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:01,990 INFO L399 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-03 20:37:01,990 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:01,990 INFO L82 PathProgramCache]: Analyzing trace with hash 195204134, now seen corresponding path program 1 times [2019-09-03 20:37:01,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:01,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:01,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:01,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:02,074 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-03 20:37:02,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:02,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:37:02,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:02,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:37:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:37:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:37:02,076 INFO L87 Difference]: Start difference. First operand 916 states and 1344 transitions. Second operand 4 states. [2019-09-03 20:37:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:02,385 INFO L93 Difference]: Finished difference Result 1148 states and 1682 transitions. [2019-09-03 20:37:02,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:37:02,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-03 20:37:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:02,391 INFO L225 Difference]: With dead ends: 1148 [2019-09-03 20:37:02,391 INFO L226 Difference]: Without dead ends: 1148 [2019-09-03 20:37:02,392 INFO L628 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-03 20:37:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-03 20:37:02,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2019-09-03 20:37:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-09-03 20:37:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1534 transitions. [2019-09-03 20:37:02,407 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1534 transitions. Word has length 124 [2019-09-03 20:37:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:02,408 INFO L475 AbstractCegarLoop]: Abstraction has 1026 states and 1534 transitions. [2019-09-03 20:37:02,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:37:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1534 transitions. [2019-09-03 20:37:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:37:02,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:02,410 INFO L399 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-03 20:37:02,411 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1476839352, now seen corresponding path program 1 times [2019-09-03 20:37:02,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:02,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:02,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:02,603 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-03 20:37:02,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:02,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:37:02,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:02,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:37:02,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:37:02,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:37:02,605 INFO L87 Difference]: Start difference. First operand 1026 states and 1534 transitions. Second operand 6 states. [2019-09-03 20:37:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:02,846 INFO L93 Difference]: Finished difference Result 1030 states and 1538 transitions. [2019-09-03 20:37:02,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:37:02,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-03 20:37:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:02,850 INFO L225 Difference]: With dead ends: 1030 [2019-09-03 20:37:02,850 INFO L226 Difference]: Without dead ends: 1030 [2019-09-03 20:37:02,851 INFO L628 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-03 20:37:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-03 20:37:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1029. [2019-09-03 20:37:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-09-03 20:37:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1537 transitions. [2019-09-03 20:37:02,864 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1537 transitions. Word has length 128 [2019-09-03 20:37:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:02,864 INFO L475 AbstractCegarLoop]: Abstraction has 1029 states and 1537 transitions. [2019-09-03 20:37:02,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:37:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1537 transitions. [2019-09-03 20:37:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:37:02,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:02,867 INFO L399 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-03 20:37:02,867 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:02,868 INFO L82 PathProgramCache]: Analyzing trace with hash -602359811, now seen corresponding path program 1 times [2019-09-03 20:37:02,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:02,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:02,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:02,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:02,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 20:37:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 20:37:03,542 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-03 20:37:03,591 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20485 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-03 20:37:03,593 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20484 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-03 20:37:03,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:37:03 BoogieIcfgContainer [2019-09-03 20:37:03,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:37:03,688 INFO L168 Benchmark]: Toolchain (without parser) took 17509.28 ms. Allocated memory was 130.5 MB in the beginning and 482.9 MB in the end (delta: 352.3 MB). Free memory was 83.0 MB in the beginning and 127.1 MB in the end (delta: -44.1 MB). Peak memory consumption was 308.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:37:03,688 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 130.5 MB. Free memory is still 103.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-03 20:37:03,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 963.38 ms. Allocated memory was 130.5 MB in the beginning and 199.2 MB in the end (delta: 68.7 MB). Free memory was 82.6 MB in the beginning and 155.3 MB in the end (delta: -72.7 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:37:03,690 INFO L168 Benchmark]: Boogie Preprocessor took 188.66 ms. Allocated memory is still 199.2 MB. Free memory was 155.3 MB in the beginning and 148.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:37:03,692 INFO L168 Benchmark]: RCFGBuilder took 1218.59 ms. Allocated memory was 199.2 MB in the beginning and 218.1 MB in the end (delta: 18.9 MB). Free memory was 148.5 MB in the beginning and 172.8 MB in the end (delta: -24.3 MB). Peak memory consumption was 88.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:37:03,695 INFO L168 Benchmark]: TraceAbstraction took 15133.41 ms. Allocated memory was 218.1 MB in the beginning and 482.9 MB in the end (delta: 264.8 MB). Free memory was 172.8 MB in the beginning and 127.1 MB in the end (delta: 45.7 MB). Peak memory consumption was 310.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:37:03,701 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.20 ms. Allocated memory is still 130.5 MB. Free memory is still 103.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 963.38 ms. Allocated memory was 130.5 MB in the beginning and 199.2 MB in the end (delta: 68.7 MB). Free memory was 82.6 MB in the beginning and 155.3 MB in the end (delta: -72.7 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 188.66 ms. Allocated memory is still 199.2 MB. Free memory was 155.3 MB in the beginning and 148.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1218.59 ms. Allocated memory was 199.2 MB in the beginning and 218.1 MB in the end (delta: 18.9 MB). Free memory was 148.5 MB in the beginning and 172.8 MB in the end (delta: -24.3 MB). Peak memory consumption was 88.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15133.41 ms. Allocated memory was 218.1 MB in the beginning and 482.9 MB in the end (delta: 264.8 MB). Free memory was 172.8 MB in the beginning and 127.1 MB in the end (delta: 45.7 MB). Peak memory consumption was 310.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20485 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 20484 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)=20532, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-4: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={2:0}, SSLv3_client_data={-4: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={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->info_callback={9:-4294967304}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4:0}, tmp=0, tmp___0={3:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->state=12292, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=0, tmp___0={3:0}, tmp___1=0, tmp___2=0] [L1249] EXPR s->version VAL [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->version=1, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->init_buf={6:-5}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, (s->s3)->tmp.reuse_message=20503, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=0, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->bbio={2:-1}, s->wbio={2:1}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, (s->s3)->tmp.reuse_message=20503, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=1, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->hit=0, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, (s->s3)->tmp.reuse_message=20503, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, ((s->s3)->tmp.new_cipher)->algorithms=20510, (s->s3)->tmp.new_cipher={20536:2}, blastFlag=2, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, (s->s3)->tmp.reuse_message=20503, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=3, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=13, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, (s->s3)->tmp.reuse_message=20503, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=10, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, (s->s3)->tmp.reuse_message=20503, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=1, s={2:0}, s={2:0}, s->state=4448, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=2, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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 [={9:-4294967304}, blastFlag=4, buf={20502:20506}, init=1, malloc(sizeof(int))={3:0}, ret=2, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-4: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, 15.0s OverallTime, 35 OverallIterations, 7 TraceHistogramMax, 10.3s 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.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 68 SyntacticMatches, 22 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s 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.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.8s 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...