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-0883e75 [2019-09-05 12:45:55,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:45:55,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:45:55,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:45:55,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:45:55,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:45:55,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:45:55,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:45:55,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:45:55,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:45:55,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:45:55,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:45:55,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:45:55,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:45:55,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:45:55,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:45:55,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:45:55,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:45:55,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:45:55,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:45:55,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:45:55,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:45:55,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:45:55,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:45:55,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:45:55,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:45:55,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:45:55,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:45:55,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:45:55,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:45:55,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:45:55,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:45:55,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:45:55,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:45:55,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:45:55,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:45:55,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:45:55,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:45:55,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:45:55,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:45:55,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:45:55,472 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-05 12:45:55,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:45:55,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:45:55,498 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 12:45:55,498 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 12:45:55,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 12:45:55,499 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 12:45:55,499 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 12:45:55,500 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 12:45:55,500 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 12:45:55,500 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 12:45:55,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:45:55,503 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:45:55,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:45:55,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:45:55,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:45:55,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:45:55,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:45:55,504 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:45:55,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:45:55,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:45:55,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:45:55,505 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 12:45:55,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:45:55,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:45:55,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:45:55,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:45:55,506 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 12:45:55,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:45:55,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:45:55,506 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 12:45:55,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:45:55,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:45:55,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:45:55,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:45:55,582 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:45:55,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3.i [2019-09-05 12:45:55,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8cd9f58/8bb5502e1a504c7aa90f98dbcb8fb1bb/FLAG2cf0465ae [2019-09-05 12:45:56,207 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:45:56,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3.i [2019-09-05 12:45:56,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8cd9f58/8bb5502e1a504c7aa90f98dbcb8fb1bb/FLAG2cf0465ae [2019-09-05 12:45:56,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8cd9f58/8bb5502e1a504c7aa90f98dbcb8fb1bb [2019-09-05 12:45:56,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:45:56,487 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:45:56,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:45:56,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:45:56,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:45:56,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:45:56" (1/1) ... [2019-09-05 12:45:56,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69aee768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:56, skipping insertion in model container [2019-09-05 12:45:56,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:45:56" (1/1) ... [2019-09-05 12:45:56,504 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:45:56,565 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:45:57,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:45:57,262 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:45:57,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:45:57,469 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:45:57,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57 WrapperNode [2019-09-05 12:45:57,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:45:57,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:45:57,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:45:57,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:45:57,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57" (1/1) ... [2019-09-05 12:45:57,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57" (1/1) ... [2019-09-05 12:45:57,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57" (1/1) ... [2019-09-05 12:45:57,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57" (1/1) ... [2019-09-05 12:45:57,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57" (1/1) ... [2019-09-05 12:45:57,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57" (1/1) ... [2019-09-05 12:45:57,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57" (1/1) ... [2019-09-05 12:45:57,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:45:57,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:45:57,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:45:57,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:45:57,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57" (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-05 12:45:57,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:45:57,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:45:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-05 12:45:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-05 12:45:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:45:57,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-05 12:45:57,801 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-05 12:45:57,801 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-05 12:45:57,801 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-05 12:45:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:45:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-05 12:45:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 12:45:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-05 12:45:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-05 12:45:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-05 12:45:57,806 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-05 12:45:57,806 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-05 12:45:57,806 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-05 12:45:57,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-05 12:45:57,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-05 12:45:57,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:45:57,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-05 12:45:57,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 12:45:57,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-05 12:45:57,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 12:45:57,809 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-05 12:45:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-05 12:45:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:45:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 12:45:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-05 12:45:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-05 12:45:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:45:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-05 12:45:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-05 12:45:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-05 12:45:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-05 12:45:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 12:45:58,532 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-05 12:45:59,332 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-05 12:45:59,333 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-05 12:45:59,359 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:45:59,359 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:45:59,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:45:59 BoogieIcfgContainer [2019-09-05 12:45:59,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:45:59,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:45:59,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:45:59,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:45:59,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:45:56" (1/3) ... [2019-09-05 12:45:59,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491a2dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:45:59, skipping insertion in model container [2019-09-05 12:45:59,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:45:57" (2/3) ... [2019-09-05 12:45:59,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491a2dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:45:59, skipping insertion in model container [2019-09-05 12:45:59,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:45:59" (3/3) ... [2019-09-05 12:45:59,369 INFO L109 eAbstractionObserver]: Analyzing ICFG s3.i [2019-09-05 12:45:59,379 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:45:59,388 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:45:59,406 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:45:59,433 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:45:59,433 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 12:45:59,433 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:45:59,434 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:45:59,434 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:45:59,434 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:45:59,434 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:45:59,434 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:45:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-05 12:45:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 12:45:59,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:45:59,467 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-05 12:45:59,470 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:45:59,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:45:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1412419194, now seen corresponding path program 1 times [2019-09-05 12:45:59,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:45:59,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:45:59,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:45:59,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:45:59,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:45:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:45:59,854 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-05 12:45:59,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:45:59,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:45:59,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:45:59,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:45:59,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:45:59,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:45:59,886 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-05 12:46:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:00,014 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2019-09-05 12:46:00,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:00,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-05 12:46:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:00,031 INFO L225 Difference]: With dead ends: 258 [2019-09-05 12:46:00,031 INFO L226 Difference]: Without dead ends: 223 [2019-09-05 12:46:00,033 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-05 12:46:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-05 12:46:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-05 12:46:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-05 12:46:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2019-09-05 12:46:00,099 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2019-09-05 12:46:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:00,100 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2019-09-05 12:46:00,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2019-09-05 12:46:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-05 12:46:00,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:00,103 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-05 12:46:00,104 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash -512814518, now seen corresponding path program 1 times [2019-09-05 12:46:00,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:00,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:00,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:00,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:00,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:00,280 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-05 12:46:00,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:00,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:00,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:00,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:00,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:00,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:00,283 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2019-09-05 12:46:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:00,351 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2019-09-05 12:46:00,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:00,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-05 12:46:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:00,355 INFO L225 Difference]: With dead ends: 325 [2019-09-05 12:46:00,355 INFO L226 Difference]: Without dead ends: 325 [2019-09-05 12:46:00,356 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-05 12:46:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-05 12:46:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-09-05 12:46:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-05 12:46:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2019-09-05 12:46:00,383 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2019-09-05 12:46:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:00,383 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2019-09-05 12:46:00,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2019-09-05 12:46:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-05 12:46:00,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:00,388 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-05 12:46:00,388 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1986020414, now seen corresponding path program 1 times [2019-09-05 12:46:00,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:00,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:00,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:00,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:00,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:00,562 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-05 12:46:00,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:00,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:00,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:00,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:00,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:00,565 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2019-09-05 12:46:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:01,175 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2019-09-05 12:46:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:01,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-05 12:46:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:01,180 INFO L225 Difference]: With dead ends: 513 [2019-09-05 12:46:01,180 INFO L226 Difference]: Without dead ends: 513 [2019-09-05 12:46:01,180 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-05 12:46:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-05 12:46:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2019-09-05 12:46:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-05 12:46:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2019-09-05 12:46:01,203 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2019-09-05 12:46:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:01,203 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2019-09-05 12:46:01,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2019-09-05 12:46:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-05 12:46:01,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:01,208 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-05 12:46:01,208 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:01,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:01,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2120033920, now seen corresponding path program 1 times [2019-09-05 12:46:01,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:01,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:01,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:01,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:01,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:01,334 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-05 12:46:01,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:01,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:01,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:01,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:01,336 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2019-09-05 12:46:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:01,681 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2019-09-05 12:46:01,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:01,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-05 12:46:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:01,685 INFO L225 Difference]: With dead ends: 459 [2019-09-05 12:46:01,685 INFO L226 Difference]: Without dead ends: 459 [2019-09-05 12:46:01,686 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-05 12:46:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-05 12:46:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2019-09-05 12:46:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-05 12:46:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2019-09-05 12:46:01,700 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2019-09-05 12:46:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:01,701 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2019-09-05 12:46:01,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2019-09-05 12:46:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 12:46:01,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:01,706 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-05 12:46:01,706 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:01,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1441508551, now seen corresponding path program 1 times [2019-09-05 12:46:01,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:01,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:01,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:01,851 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-05 12:46:01,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:01,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:01,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:01,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:01,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:01,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:01,855 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2019-09-05 12:46:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:02,428 INFO L93 Difference]: Finished difference Result 547 states and 814 transitions. [2019-09-05 12:46:02,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:02,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-05 12:46:02,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:02,433 INFO L225 Difference]: With dead ends: 547 [2019-09-05 12:46:02,433 INFO L226 Difference]: Without dead ends: 547 [2019-09-05 12:46:02,434 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-05 12:46:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-05 12:46:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2019-09-05 12:46:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-05 12:46:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2019-09-05 12:46:02,448 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2019-09-05 12:46:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:02,449 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2019-09-05 12:46:02,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2019-09-05 12:46:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-05 12:46:02,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:02,452 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-05 12:46:02,452 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:02,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1741349123, now seen corresponding path program 1 times [2019-09-05 12:46:02,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:02,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:02,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:02,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:02,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:02,547 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-05 12:46:02,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:02,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:02,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:02,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:02,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:02,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:02,550 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2019-09-05 12:46:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:03,058 INFO L93 Difference]: Finished difference Result 547 states and 812 transitions. [2019-09-05 12:46:03,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:03,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-05 12:46:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:03,067 INFO L225 Difference]: With dead ends: 547 [2019-09-05 12:46:03,068 INFO L226 Difference]: Without dead ends: 547 [2019-09-05 12:46:03,068 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-05 12:46:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-05 12:46:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2019-09-05 12:46:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-05 12:46:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2019-09-05 12:46:03,081 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2019-09-05 12:46:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:03,081 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2019-09-05 12:46:03,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2019-09-05 12:46:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 12:46:03,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:03,083 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-05 12:46:03,083 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:03,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1848274964, now seen corresponding path program 1 times [2019-09-05 12:46:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:03,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:03,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:03,177 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-05 12:46:03,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:03,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:03,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:03,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:03,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:03,180 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2019-09-05 12:46:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:03,620 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2019-09-05 12:46:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:03,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-05 12:46:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:03,623 INFO L225 Difference]: With dead ends: 537 [2019-09-05 12:46:03,623 INFO L226 Difference]: Without dead ends: 537 [2019-09-05 12:46:03,623 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-05 12:46:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-05 12:46:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2019-09-05 12:46:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2019-09-05 12:46:03,633 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2019-09-05 12:46:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:03,634 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2019-09-05 12:46:03,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2019-09-05 12:46:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:46:03,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:03,636 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-05 12:46:03,636 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2132058447, now seen corresponding path program 1 times [2019-09-05 12:46:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:03,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:03,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:03,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:03,716 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-05 12:46:03,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:03,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:03,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:03,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:03,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:03,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:03,719 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2019-09-05 12:46:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:04,180 INFO L93 Difference]: Finished difference Result 535 states and 794 transitions. [2019-09-05 12:46:04,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:04,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-05 12:46:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:04,186 INFO L225 Difference]: With dead ends: 535 [2019-09-05 12:46:04,187 INFO L226 Difference]: Without dead ends: 535 [2019-09-05 12:46:04,187 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-05 12:46:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-05 12:46:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-05 12:46:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2019-09-05 12:46:04,201 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2019-09-05 12:46:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:04,202 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2019-09-05 12:46:04,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2019-09-05 12:46:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:46:04,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:04,235 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-05 12:46:04,235 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:04,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2113402989, now seen corresponding path program 1 times [2019-09-05 12:46:04,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:04,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:04,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:04,331 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-05 12:46:04,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:04,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:04,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:04,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:04,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:04,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:04,333 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2019-09-05 12:46:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:04,749 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2019-09-05 12:46:04,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:04,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-05 12:46:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:04,753 INFO L225 Difference]: With dead ends: 535 [2019-09-05 12:46:04,753 INFO L226 Difference]: Without dead ends: 535 [2019-09-05 12:46:04,754 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-05 12:46:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-05 12:46:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-05 12:46:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-09-05 12:46:04,764 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2019-09-05 12:46:04,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:04,767 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-09-05 12:46:04,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-09-05 12:46:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:46:04,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:04,774 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-05 12:46:04,774 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1407902352, now seen corresponding path program 1 times [2019-09-05 12:46:04,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:04,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:04,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:04,876 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-05 12:46:04,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:04,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:04,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:04,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:04,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:04,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:04,878 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-09-05 12:46:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:05,360 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2019-09-05 12:46:05,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:05,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-05 12:46:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:05,364 INFO L225 Difference]: With dead ends: 535 [2019-09-05 12:46:05,364 INFO L226 Difference]: Without dead ends: 535 [2019-09-05 12:46:05,365 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-05 12:46:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-05 12:46:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-05 12:46:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2019-09-05 12:46:05,376 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2019-09-05 12:46:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:05,377 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2019-09-05 12:46:05,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2019-09-05 12:46:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:46:05,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:05,379 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-05 12:46:05,379 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:05,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:05,380 INFO L82 PathProgramCache]: Analyzing trace with hash 286691281, now seen corresponding path program 1 times [2019-09-05 12:46:05,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:05,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:05,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:05,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:05,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:05,440 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-05 12:46:05,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:05,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:05,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:05,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:05,442 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2019-09-05 12:46:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:05,716 INFO L93 Difference]: Finished difference Result 463 states and 681 transitions. [2019-09-05 12:46:05,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:05,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-05 12:46:05,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:05,719 INFO L225 Difference]: With dead ends: 463 [2019-09-05 12:46:05,719 INFO L226 Difference]: Without dead ends: 463 [2019-09-05 12:46:05,720 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-05 12:46:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-05 12:46:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-05 12:46:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2019-09-05 12:46:05,732 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2019-09-05 12:46:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:05,732 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2019-09-05 12:46:05,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2019-09-05 12:46:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:46:05,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:05,734 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-05 12:46:05,735 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:05,735 INFO L82 PathProgramCache]: Analyzing trace with hash 268035823, now seen corresponding path program 1 times [2019-09-05 12:46:05,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:05,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:05,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:05,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:05,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:05,799 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-05 12:46:05,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:05,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:05,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:05,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:05,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:05,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:05,802 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2019-09-05 12:46:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:06,099 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2019-09-05 12:46:06,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:06,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-05 12:46:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:06,102 INFO L225 Difference]: With dead ends: 463 [2019-09-05 12:46:06,102 INFO L226 Difference]: Without dead ends: 463 [2019-09-05 12:46:06,102 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-05 12:46:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-05 12:46:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-05 12:46:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2019-09-05 12:46:06,133 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2019-09-05 12:46:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:06,133 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2019-09-05 12:46:06,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2019-09-05 12:46:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:46:06,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:06,135 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-05 12:46:06,135 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:06,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:06,136 INFO L82 PathProgramCache]: Analyzing trace with hash -437464814, now seen corresponding path program 1 times [2019-09-05 12:46:06,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:06,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:06,195 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-05 12:46:06,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:06,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:06,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:06,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:06,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:06,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:06,197 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2019-09-05 12:46:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:06,486 INFO L93 Difference]: Finished difference Result 463 states and 677 transitions. [2019-09-05 12:46:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:06,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-05 12:46:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:06,491 INFO L225 Difference]: With dead ends: 463 [2019-09-05 12:46:06,491 INFO L226 Difference]: Without dead ends: 463 [2019-09-05 12:46:06,492 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-05 12:46:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-05 12:46:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-05 12:46:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2019-09-05 12:46:06,501 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2019-09-05 12:46:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:06,502 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2019-09-05 12:46:06,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2019-09-05 12:46:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-05 12:46:06,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:06,504 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-05 12:46:06,504 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:06,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1076828074, now seen corresponding path program 1 times [2019-09-05 12:46:06,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:06,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:06,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:06,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:06,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:06,575 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-05 12:46:06,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:06,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:06,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:06,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:06,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:06,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:06,577 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2019-09-05 12:46:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:06,945 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2019-09-05 12:46:06,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:06,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-05 12:46:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:06,949 INFO L225 Difference]: With dead ends: 535 [2019-09-05 12:46:06,949 INFO L226 Difference]: Without dead ends: 535 [2019-09-05 12:46:06,949 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-05 12:46:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-05 12:46:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-05 12:46:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-09-05 12:46:06,963 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2019-09-05 12:46:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:06,963 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-09-05 12:46:06,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-09-05 12:46:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-05 12:46:06,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:06,965 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-05 12:46:06,965 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:06,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash 979180473, now seen corresponding path program 1 times [2019-09-05 12:46:06,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:06,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:06,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:07,030 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-05 12:46:07,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:07,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:07,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:07,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:07,031 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-09-05 12:46:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:07,381 INFO L93 Difference]: Finished difference Result 529 states and 773 transitions. [2019-09-05 12:46:07,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:07,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-05 12:46:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:07,384 INFO L225 Difference]: With dead ends: 529 [2019-09-05 12:46:07,384 INFO L226 Difference]: Without dead ends: 529 [2019-09-05 12:46:07,385 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-05 12:46:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-05 12:46:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-05 12:46:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2019-09-05 12:46:07,394 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2019-09-05 12:46:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:07,395 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2019-09-05 12:46:07,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2019-09-05 12:46:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-05 12:46:07,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:07,397 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-05 12:46:07,397 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:07,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1846331924, now seen corresponding path program 1 times [2019-09-05 12:46:07,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:07,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:07,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:07,449 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-05 12:46:07,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:07,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:07,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:07,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:07,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:07,451 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2019-09-05 12:46:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:07,716 INFO L93 Difference]: Finished difference Result 463 states and 671 transitions. [2019-09-05 12:46:07,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:07,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-05 12:46:07,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:07,719 INFO L225 Difference]: With dead ends: 463 [2019-09-05 12:46:07,719 INFO L226 Difference]: Without dead ends: 463 [2019-09-05 12:46:07,720 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-05 12:46:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-05 12:46:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-05 12:46:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2019-09-05 12:46:07,729 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2019-09-05 12:46:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:07,729 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2019-09-05 12:46:07,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2019-09-05 12:46:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-05 12:46:07,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:07,731 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-05 12:46:07,731 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:07,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash -392626825, now seen corresponding path program 1 times [2019-09-05 12:46:07,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:07,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:07,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:07,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:07,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:07,794 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-05 12:46:07,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:07,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:07,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:07,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:07,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:07,796 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2019-09-05 12:46:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:08,044 INFO L93 Difference]: Finished difference Result 457 states and 662 transitions. [2019-09-05 12:46:08,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:08,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-05 12:46:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:08,048 INFO L225 Difference]: With dead ends: 457 [2019-09-05 12:46:08,048 INFO L226 Difference]: Without dead ends: 457 [2019-09-05 12:46:08,048 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-05 12:46:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-05 12:46:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-05 12:46:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2019-09-05 12:46:08,057 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2019-09-05 12:46:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:08,058 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2019-09-05 12:46:08,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2019-09-05 12:46:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 12:46:08,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:08,059 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-05 12:46:08,060 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:08,060 INFO L82 PathProgramCache]: Analyzing trace with hash 564256466, now seen corresponding path program 1 times [2019-09-05 12:46:08,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:08,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:08,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:08,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:08,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:08,116 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-05 12:46:08,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:08,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:08,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:08,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:08,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:08,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:08,118 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2019-09-05 12:46:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:08,478 INFO L93 Difference]: Finished difference Result 529 states and 767 transitions. [2019-09-05 12:46:08,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:08,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-05 12:46:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:08,482 INFO L225 Difference]: With dead ends: 529 [2019-09-05 12:46:08,483 INFO L226 Difference]: Without dead ends: 529 [2019-09-05 12:46:08,483 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-05 12:46:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-05 12:46:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-05 12:46:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2019-09-05 12:46:08,492 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2019-09-05 12:46:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:08,493 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2019-09-05 12:46:08,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2019-09-05 12:46:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 12:46:08,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:08,495 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-05 12:46:08,495 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash 987903188, now seen corresponding path program 1 times [2019-09-05 12:46:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:08,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:08,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:08,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:08,554 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-05 12:46:08,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:08,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:08,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:08,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:08,556 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2019-09-05 12:46:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:08,810 INFO L93 Difference]: Finished difference Result 457 states and 658 transitions. [2019-09-05 12:46:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:08,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-05 12:46:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:08,813 INFO L225 Difference]: With dead ends: 457 [2019-09-05 12:46:08,813 INFO L226 Difference]: Without dead ends: 457 [2019-09-05 12:46:08,814 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-05 12:46:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-05 12:46:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-05 12:46:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2019-09-05 12:46:08,827 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2019-09-05 12:46:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:08,828 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2019-09-05 12:46:08,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2019-09-05 12:46:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-05 12:46:08,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:08,832 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-05 12:46:08,832 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:08,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1652269339, now seen corresponding path program 1 times [2019-09-05 12:46:08,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:08,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:08,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:08,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:08,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:08,898 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-05 12:46:08,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:08,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:08,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:08,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:08,900 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2019-09-05 12:46:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:09,249 INFO L93 Difference]: Finished difference Result 511 states and 741 transitions. [2019-09-05 12:46:09,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:09,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-05 12:46:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:09,252 INFO L225 Difference]: With dead ends: 511 [2019-09-05 12:46:09,252 INFO L226 Difference]: Without dead ends: 511 [2019-09-05 12:46:09,253 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-05 12:46:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-05 12:46:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-05 12:46:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2019-09-05 12:46:09,263 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2019-09-05 12:46:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:09,264 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2019-09-05 12:46:09,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2019-09-05 12:46:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-05 12:46:09,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:09,266 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-05 12:46:09,267 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash -39157652, now seen corresponding path program 1 times [2019-09-05 12:46:09,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:09,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:09,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:09,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:09,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:09,336 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-05 12:46:09,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:09,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:09,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:09,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:09,339 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2019-09-05 12:46:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:09,733 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2019-09-05 12:46:09,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:09,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-05 12:46:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:09,736 INFO L225 Difference]: With dead ends: 511 [2019-09-05 12:46:09,736 INFO L226 Difference]: Without dead ends: 511 [2019-09-05 12:46:09,737 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-05 12:46:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-05 12:46:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-05 12:46:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2019-09-05 12:46:09,745 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2019-09-05 12:46:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:09,745 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2019-09-05 12:46:09,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2019-09-05 12:46:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-05 12:46:09,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:09,747 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-05 12:46:09,747 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:09,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1900415833, now seen corresponding path program 1 times [2019-09-05 12:46:09,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:09,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:09,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:09,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:09,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:09,805 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-05 12:46:09,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:09,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:09,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:09,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:09,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:09,807 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2019-09-05 12:46:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:10,084 INFO L93 Difference]: Finished difference Result 439 states and 630 transitions. [2019-09-05 12:46:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:10,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-05 12:46:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:10,087 INFO L225 Difference]: With dead ends: 439 [2019-09-05 12:46:10,087 INFO L226 Difference]: Without dead ends: 439 [2019-09-05 12:46:10,088 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-05 12:46:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-05 12:46:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2019-09-05 12:46:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-05 12:46:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2019-09-05 12:46:10,099 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2019-09-05 12:46:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:10,100 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2019-09-05 12:46:10,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2019-09-05 12:46:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-05 12:46:10,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:10,103 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-05 12:46:10,103 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:10,104 INFO L82 PathProgramCache]: Analyzing trace with hash 208988842, now seen corresponding path program 1 times [2019-09-05 12:46:10,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:10,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:10,175 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-05 12:46:10,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:10,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:10,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:10,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:10,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:10,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:10,177 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2019-09-05 12:46:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:10,204 INFO L93 Difference]: Finished difference Result 574 states and 827 transitions. [2019-09-05 12:46:10,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:10,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-05 12:46:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:10,207 INFO L225 Difference]: With dead ends: 574 [2019-09-05 12:46:10,207 INFO L226 Difference]: Without dead ends: 574 [2019-09-05 12:46:10,208 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-05 12:46:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-05 12:46:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-05 12:46:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-05 12:46:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2019-09-05 12:46:10,217 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2019-09-05 12:46:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:10,218 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2019-09-05 12:46:10,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2019-09-05 12:46:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-05 12:46:10,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:10,220 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-05 12:46:10,220 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1641385280, now seen corresponding path program 1 times [2019-09-05 12:46:10,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:10,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:10,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:10,287 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-05 12:46:10,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:10,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:10,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:10,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:10,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:10,290 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2019-09-05 12:46:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:10,318 INFO L93 Difference]: Finished difference Result 727 states and 1049 transitions. [2019-09-05 12:46:10,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:10,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-05 12:46:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:10,322 INFO L225 Difference]: With dead ends: 727 [2019-09-05 12:46:10,322 INFO L226 Difference]: Without dead ends: 727 [2019-09-05 12:46:10,324 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-05 12:46:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-05 12:46:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-05 12:46:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-05 12:46:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2019-09-05 12:46:10,338 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2019-09-05 12:46:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:10,339 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2019-09-05 12:46:10,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2019-09-05 12:46:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-05 12:46:10,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:10,341 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-05 12:46:10,341 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1283662913, now seen corresponding path program 1 times [2019-09-05 12:46:10,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:10,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:10,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:10,403 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-05 12:46:10,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:10,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:10,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:10,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:10,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:10,405 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2019-09-05 12:46:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:10,432 INFO L93 Difference]: Finished difference Result 724 states and 1039 transitions. [2019-09-05 12:46:10,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:10,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-05 12:46:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:10,436 INFO L225 Difference]: With dead ends: 724 [2019-09-05 12:46:10,436 INFO L226 Difference]: Without dead ends: 724 [2019-09-05 12:46:10,437 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-05 12:46:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-05 12:46:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-09-05 12:46:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-09-05 12:46:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1039 transitions. [2019-09-05 12:46:10,448 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1039 transitions. Word has length 104 [2019-09-05 12:46:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:10,448 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 1039 transitions. [2019-09-05 12:46:10,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1039 transitions. [2019-09-05 12:46:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-05 12:46:10,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:10,451 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-05 12:46:10,451 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 803234748, now seen corresponding path program 1 times [2019-09-05 12:46:10,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:10,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:10,529 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-05 12:46:10,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:10,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:10,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:10,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:10,531 INFO L87 Difference]: Start difference. First operand 724 states and 1039 transitions. Second operand 4 states. [2019-09-05 12:46:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:10,813 INFO L93 Difference]: Finished difference Result 981 states and 1412 transitions. [2019-09-05 12:46:10,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:10,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-05 12:46:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:10,819 INFO L225 Difference]: With dead ends: 981 [2019-09-05 12:46:10,819 INFO L226 Difference]: Without dead ends: 981 [2019-09-05 12:46:10,819 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-05 12:46:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-09-05 12:46:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2019-09-05 12:46:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-05 12:46:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1249 transitions. [2019-09-05 12:46:10,834 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1249 transitions. Word has length 106 [2019-09-05 12:46:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:10,834 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1249 transitions. [2019-09-05 12:46:10,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1249 transitions. [2019-09-05 12:46:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-05 12:46:10,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:10,837 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-05 12:46:10,838 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:10,838 INFO L82 PathProgramCache]: Analyzing trace with hash -876635477, now seen corresponding path program 1 times [2019-09-05 12:46:10,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:10,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:10,957 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-05 12:46:10,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:10,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:10,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:10,959 INFO L87 Difference]: Start difference. First operand 844 states and 1249 transitions. Second operand 4 states. [2019-09-05 12:46:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:11,249 INFO L93 Difference]: Finished difference Result 976 states and 1402 transitions. [2019-09-05 12:46:11,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:11,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-05 12:46:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:11,256 INFO L225 Difference]: With dead ends: 976 [2019-09-05 12:46:11,256 INFO L226 Difference]: Without dead ends: 976 [2019-09-05 12:46:11,256 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-05 12:46:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-05 12:46:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-09-05 12:46:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-05 12:46:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1244 transitions. [2019-09-05 12:46:11,270 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1244 transitions. Word has length 121 [2019-09-05 12:46:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:11,271 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1244 transitions. [2019-09-05 12:46:11,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1244 transitions. [2019-09-05 12:46:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-05 12:46:11,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:11,273 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-05 12:46:11,274 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1624661431, now seen corresponding path program 1 times [2019-09-05 12:46:11,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:11,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:11,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:11,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:11,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:11,353 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-05 12:46:11,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:11,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:11,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:11,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:11,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:11,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:11,355 INFO L87 Difference]: Start difference. First operand 844 states and 1244 transitions. Second operand 4 states. [2019-09-05 12:46:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:11,691 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-09-05 12:46:11,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:11,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-05 12:46:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:11,698 INFO L225 Difference]: With dead ends: 976 [2019-09-05 12:46:11,698 INFO L226 Difference]: Without dead ends: 976 [2019-09-05 12:46:11,699 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-05 12:46:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-05 12:46:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-09-05 12:46:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-05 12:46:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1239 transitions. [2019-09-05 12:46:11,726 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1239 transitions. Word has length 121 [2019-09-05 12:46:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:11,726 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1239 transitions. [2019-09-05 12:46:11,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1239 transitions. [2019-09-05 12:46:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-05 12:46:11,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:11,731 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-05 12:46:11,731 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:11,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1005940820, now seen corresponding path program 1 times [2019-09-05 12:46:11,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:11,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:11,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:11,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:11,830 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-05 12:46:11,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:11,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:11,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:11,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:11,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:11,833 INFO L87 Difference]: Start difference. First operand 844 states and 1239 transitions. Second operand 4 states. [2019-09-05 12:46:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:12,140 INFO L93 Difference]: Finished difference Result 982 states and 1440 transitions. [2019-09-05 12:46:12,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:12,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-05 12:46:12,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:12,145 INFO L225 Difference]: With dead ends: 982 [2019-09-05 12:46:12,146 INFO L226 Difference]: Without dead ends: 982 [2019-09-05 12:46:12,148 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-05 12:46:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-09-05 12:46:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2019-09-05 12:46:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-05 12:46:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1359 transitions. [2019-09-05 12:46:12,171 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1359 transitions. Word has length 121 [2019-09-05 12:46:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:12,172 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1359 transitions. [2019-09-05 12:46:12,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1359 transitions. [2019-09-05 12:46:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-05 12:46:12,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:12,174 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-05 12:46:12,175 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:12,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:12,175 INFO L82 PathProgramCache]: Analyzing trace with hash 908942672, now seen corresponding path program 1 times [2019-09-05 12:46:12,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:12,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:12,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:12,244 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-05 12:46:12,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:12,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:12,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:12,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:12,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:12,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:12,246 INFO L87 Difference]: Start difference. First operand 916 states and 1359 transitions. Second operand 4 states. [2019-09-05 12:46:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:12,513 INFO L93 Difference]: Finished difference Result 1048 states and 1512 transitions. [2019-09-05 12:46:12,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:12,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-05 12:46:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:12,517 INFO L225 Difference]: With dead ends: 1048 [2019-09-05 12:46:12,517 INFO L226 Difference]: Without dead ends: 1048 [2019-09-05 12:46:12,518 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-05 12:46:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-05 12:46:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-09-05 12:46:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-05 12:46:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1354 transitions. [2019-09-05 12:46:12,532 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1354 transitions. Word has length 122 [2019-09-05 12:46:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:12,533 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1354 transitions. [2019-09-05 12:46:12,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1354 transitions. [2019-09-05 12:46:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-05 12:46:12,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:12,535 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-05 12:46:12,536 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash -187191506, now seen corresponding path program 1 times [2019-09-05 12:46:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:12,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:12,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:12,605 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-05 12:46:12,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:12,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:12,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:12,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:12,607 INFO L87 Difference]: Start difference. First operand 916 states and 1354 transitions. Second operand 4 states. [2019-09-05 12:46:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:12,887 INFO L93 Difference]: Finished difference Result 1048 states and 1507 transitions. [2019-09-05 12:46:12,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:12,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-05 12:46:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:12,892 INFO L225 Difference]: With dead ends: 1048 [2019-09-05 12:46:12,892 INFO L226 Difference]: Without dead ends: 1048 [2019-09-05 12:46:12,893 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-05 12:46:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-05 12:46:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-09-05 12:46:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-05 12:46:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1349 transitions. [2019-09-05 12:46:12,920 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1349 transitions. Word has length 123 [2019-09-05 12:46:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:12,921 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1349 transitions. [2019-09-05 12:46:12,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1349 transitions. [2019-09-05 12:46:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-05 12:46:12,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:12,924 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-05 12:46:12,924 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2136062699, now seen corresponding path program 1 times [2019-09-05 12:46:12,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:12,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:13,029 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-05 12:46:13,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:13,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:13,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:13,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:13,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:13,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:13,031 INFO L87 Difference]: Start difference. First operand 916 states and 1349 transitions. Second operand 4 states. [2019-09-05 12:46:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:13,270 INFO L93 Difference]: Finished difference Result 1003 states and 1447 transitions. [2019-09-05 12:46:13,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:13,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-05 12:46:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:13,276 INFO L225 Difference]: With dead ends: 1003 [2019-09-05 12:46:13,277 INFO L226 Difference]: Without dead ends: 1003 [2019-09-05 12:46:13,277 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-05 12:46:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-09-05 12:46:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2019-09-05 12:46:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-05 12:46:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1344 transitions. [2019-09-05 12:46:13,291 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1344 transitions. Word has length 124 [2019-09-05 12:46:13,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:13,292 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1344 transitions. [2019-09-05 12:46:13,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1344 transitions. [2019-09-05 12:46:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-05 12:46:13,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:13,295 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-05 12:46:13,295 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:13,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash 195204134, now seen corresponding path program 1 times [2019-09-05 12:46:13,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:13,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:13,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:13,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:13,365 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-05 12:46:13,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:13,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:13,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:13,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:13,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:13,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:13,367 INFO L87 Difference]: Start difference. First operand 916 states and 1344 transitions. Second operand 4 states. [2019-09-05 12:46:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:13,627 INFO L93 Difference]: Finished difference Result 1148 states and 1682 transitions. [2019-09-05 12:46:13,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:13,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-05 12:46:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:13,633 INFO L225 Difference]: With dead ends: 1148 [2019-09-05 12:46:13,633 INFO L226 Difference]: Without dead ends: 1148 [2019-09-05 12:46:13,634 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-05 12:46:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-05 12:46:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2019-09-05 12:46:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-09-05 12:46:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1534 transitions. [2019-09-05 12:46:13,652 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1534 transitions. Word has length 124 [2019-09-05 12:46:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:13,653 INFO L475 AbstractCegarLoop]: Abstraction has 1026 states and 1534 transitions. [2019-09-05 12:46:13,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1534 transitions. [2019-09-05 12:46:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-05 12:46:13,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:13,656 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-05 12:46:13,656 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1476839352, now seen corresponding path program 1 times [2019-09-05 12:46:13,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:13,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:13,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:13,873 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-05 12:46:13,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:13,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 12:46:13,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:13,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:46:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:46:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:46:13,876 INFO L87 Difference]: Start difference. First operand 1026 states and 1534 transitions. Second operand 6 states. [2019-09-05 12:46:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:14,151 INFO L93 Difference]: Finished difference Result 1030 states and 1538 transitions. [2019-09-05 12:46:14,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:46:14,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-05 12:46:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:14,157 INFO L225 Difference]: With dead ends: 1030 [2019-09-05 12:46:14,157 INFO L226 Difference]: Without dead ends: 1030 [2019-09-05 12:46:14,158 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-05 12:46:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-05 12:46:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1029. [2019-09-05 12:46:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-09-05 12:46:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1537 transitions. [2019-09-05 12:46:14,177 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1537 transitions. Word has length 128 [2019-09-05 12:46:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:14,177 INFO L475 AbstractCegarLoop]: Abstraction has 1029 states and 1537 transitions. [2019-09-05 12:46:14,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:46:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1537 transitions. [2019-09-05 12:46:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 12:46:14,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:14,186 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-05 12:46:14,186 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash -602359811, now seen corresponding path program 1 times [2019-09-05 12:46:14,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:14,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:14,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:14,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:14,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-05 12:46:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-05 12:46:15,005 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-05 12:46:15,055 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-05 12:46:15,057 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-05 12:46:15,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:46:15 BoogieIcfgContainer [2019-09-05 12:46:15,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 12:46:15,180 INFO L168 Benchmark]: Toolchain (without parser) took 18692.49 ms. Allocated memory was 130.5 MB in the beginning and 505.4 MB in the end (delta: 374.9 MB). Free memory was 84.0 MB in the beginning and 385.8 MB in the end (delta: -301.9 MB). Peak memory consumption was 341.0 MB. Max. memory is 7.1 GB. [2019-09-05 12:46:15,180 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 130.5 MB. Free memory was 104.7 MB in the beginning and 104.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 12:46:15,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 983.31 ms. Allocated memory was 130.5 MB in the beginning and 198.7 MB in the end (delta: 68.2 MB). Free memory was 83.8 MB in the beginning and 154.7 MB in the end (delta: -70.9 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2019-09-05 12:46:15,181 INFO L168 Benchmark]: Boogie Preprocessor took 231.63 ms. Allocated memory is still 198.7 MB. Free memory was 154.7 MB in the beginning and 147.3 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. [2019-09-05 12:46:15,182 INFO L168 Benchmark]: RCFGBuilder took 1657.66 ms. Allocated memory was 198.7 MB in the beginning and 217.6 MB in the end (delta: 18.9 MB). Free memory was 147.3 MB in the beginning and 173.3 MB in the end (delta: -26.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. [2019-09-05 12:46:15,183 INFO L168 Benchmark]: TraceAbstraction took 15815.52 ms. Allocated memory was 217.6 MB in the beginning and 505.4 MB in the end (delta: 287.8 MB). Free memory was 171.9 MB in the beginning and 385.8 MB in the end (delta: -213.9 MB). Peak memory consumption was 341.9 MB. Max. memory is 7.1 GB. [2019-09-05 12:46:15,186 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 was 104.7 MB in the beginning and 104.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 983.31 ms. Allocated memory was 130.5 MB in the beginning and 198.7 MB in the end (delta: 68.2 MB). Free memory was 83.8 MB in the beginning and 154.7 MB in the end (delta: -70.9 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 231.63 ms. Allocated memory is still 198.7 MB. Free memory was 154.7 MB in the beginning and 147.3 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1657.66 ms. Allocated memory was 198.7 MB in the beginning and 217.6 MB in the end (delta: 18.9 MB). Free memory was 147.3 MB in the beginning and 173.3 MB in the end (delta: -26.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15815.52 ms. Allocated memory was 217.6 MB in the beginning and 505.4 MB in the end (delta: 287.8 MB). Free memory was 171.9 MB in the beginning and 385.8 MB in the end (delta: -213.9 MB). Peak memory consumption was 341.9 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.7s OverallTime, 35 OverallIterations, 7 TraceHistogramMax, 10.6s 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.2s 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.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s 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...