java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:51,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:51,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:51,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:51,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:51,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:51,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:51,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:51,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:51,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:51,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:51,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:51,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:51,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:51,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:51,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:51,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:51,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:51,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:51,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:51,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:51,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:51,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:51,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:51,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:51,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:51,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:51,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:51,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:51,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:51,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:51,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:51,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:51,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:51,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:51,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:51,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:51,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:51,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:51,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:51,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:51,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:04:51,370 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:51,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:51,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:51,373 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:51,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:51,374 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:51,374 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:51,375 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:51,375 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:51,375 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:51,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:51,376 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:51,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:51,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:51,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:51,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:51,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:51,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:51,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:51,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:51,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:51,379 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:51,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:51,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:51,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:51,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:51,381 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:51,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:51,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:51,382 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:51,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:51,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:51,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:51,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:51,455 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:51,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-2.c [2019-09-16 17:04:51,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aadde5f08/e737c9ef467747fcb733f52c4e400579/FLAG0c27cdf98 [2019-09-16 17:04:52,180 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:52,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-2.c [2019-09-16 17:04:52,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aadde5f08/e737c9ef467747fcb733f52c4e400579/FLAG0c27cdf98 [2019-09-16 17:04:52,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aadde5f08/e737c9ef467747fcb733f52c4e400579 [2019-09-16 17:04:52,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:52,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:52,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:52,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:52,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:52,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2ca7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52, skipping insertion in model container [2019-09-16 17:04:52,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,452 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:52,533 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:53,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:53,115 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:53,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:53,273 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:53,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53 WrapperNode [2019-09-16 17:04:53,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:53,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:53,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:53,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:53,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:53,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:53,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:53,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:53,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:53,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:53,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:53,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-16 17:04:53,555 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-16 17:04:53,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:53,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 17:04:53,556 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:04:53,556 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:04:53,556 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:04:53,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:53,556 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:04:53,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:04:53,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:53,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:04:53,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:04:53,560 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:04:53,560 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-16 17:04:53,560 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:04:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 17:04:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-16 17:04:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:04:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:04:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:04:53,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:04:53,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:04:53,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:04:53,563 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:04:53,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:04:53,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:04:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:04:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:04:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:53,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:04:53,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:04:53,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:04:53,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:04:53,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:04:54,210 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:54,937 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 17:04:54,937 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 17:04:54,961 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:54,962 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:54,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:54 BoogieIcfgContainer [2019-09-16 17:04:54,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:54,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:54,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:54,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:54,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:52" (1/3) ... [2019-09-16 17:04:54,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706de3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:54, skipping insertion in model container [2019-09-16 17:04:54,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (2/3) ... [2019-09-16 17:04:54,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706de3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:54, skipping insertion in model container [2019-09-16 17:04:54,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:54" (3/3) ... [2019-09-16 17:04:54,972 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2019-09-16 17:04:54,983 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:54,995 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:55,014 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:55,045 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:55,046 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:55,046 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:55,046 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:55,046 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:55,046 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:55,047 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:55,047 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-16 17:04:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:55,085 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:55,086 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:55,090 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1412419194, now seen corresponding path program 1 times [2019-09-16 17:04:55,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:55,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:55,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:55,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:55,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:55,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:55,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:55,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:55,604 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-16 17:04:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:55,710 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2019-09-16 17:04:55,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:55,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:04:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:55,728 INFO L225 Difference]: With dead ends: 258 [2019-09-16 17:04:55,728 INFO L226 Difference]: Without dead ends: 223 [2019-09-16 17:04:55,730 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-16 17:04:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-16 17:04:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-16 17:04:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2019-09-16 17:04:55,818 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2019-09-16 17:04:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:55,819 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2019-09-16 17:04:55,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2019-09-16 17:04:55,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:04:55,823 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:55,823 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:55,823 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:55,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:55,824 INFO L82 PathProgramCache]: Analyzing trace with hash -512814518, now seen corresponding path program 1 times [2019-09-16 17:04:55,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:55,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:55,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:55,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:55,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:55,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:55,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:55,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:55,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:55,940 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2019-09-16 17:04:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:56,005 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2019-09-16 17:04:56,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:56,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 17:04:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:56,010 INFO L225 Difference]: With dead ends: 325 [2019-09-16 17:04:56,010 INFO L226 Difference]: Without dead ends: 325 [2019-09-16 17:04:56,013 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-16 17:04:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-09-16 17:04:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-16 17:04:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2019-09-16 17:04:56,058 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2019-09-16 17:04:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:56,058 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2019-09-16 17:04:56,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2019-09-16 17:04:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:04:56,063 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:56,063 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:56,063 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:56,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:56,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1986020414, now seen corresponding path program 1 times [2019-09-16 17:04:56,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:56,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:56,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:56,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:56,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:56,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:56,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:56,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:56,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:56,268 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2019-09-16 17:04:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:56,877 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2019-09-16 17:04:56,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:56,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:04:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:56,881 INFO L225 Difference]: With dead ends: 513 [2019-09-16 17:04:56,881 INFO L226 Difference]: Without dead ends: 513 [2019-09-16 17:04:56,882 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-16 17:04:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2019-09-16 17:04:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-16 17:04:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2019-09-16 17:04:56,898 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2019-09-16 17:04:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:56,899 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2019-09-16 17:04:56,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2019-09-16 17:04:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:04:56,903 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:56,903 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:56,904 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:56,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2120033920, now seen corresponding path program 1 times [2019-09-16 17:04:56,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:56,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:56,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:56,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:56,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:57,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:57,000 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2019-09-16 17:04:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:57,360 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2019-09-16 17:04:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:57,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:04:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:57,363 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:04:57,364 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:04:57,364 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:04:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2019-09-16 17:04:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-16 17:04:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2019-09-16 17:04:57,377 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2019-09-16 17:04:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:57,377 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2019-09-16 17:04:57,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2019-09-16 17:04:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:04:57,380 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:57,380 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:57,380 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1441508551, now seen corresponding path program 1 times [2019-09-16 17:04:57,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:57,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:57,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:57,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:57,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:57,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:57,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:57,471 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2019-09-16 17:04:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:57,954 INFO L93 Difference]: Finished difference Result 547 states and 814 transitions. [2019-09-16 17:04:57,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:57,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:04:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:57,962 INFO L225 Difference]: With dead ends: 547 [2019-09-16 17:04:57,962 INFO L226 Difference]: Without dead ends: 547 [2019-09-16 17:04:57,963 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-16 17:04:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2019-09-16 17:04:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:04:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2019-09-16 17:04:57,978 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2019-09-16 17:04:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:57,979 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2019-09-16 17:04:57,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2019-09-16 17:04:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:04:57,981 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:57,981 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:57,981 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:57,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1741349123, now seen corresponding path program 1 times [2019-09-16 17:04:57,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:58,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:58,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:58,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:58,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:58,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:58,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:58,119 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2019-09-16 17:04:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:58,622 INFO L93 Difference]: Finished difference Result 547 states and 812 transitions. [2019-09-16 17:04:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:58,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:04:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:58,627 INFO L225 Difference]: With dead ends: 547 [2019-09-16 17:04:58,627 INFO L226 Difference]: Without dead ends: 547 [2019-09-16 17:04:58,628 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-16 17:04:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2019-09-16 17:04:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:04:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2019-09-16 17:04:58,640 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2019-09-16 17:04:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:58,641 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2019-09-16 17:04:58,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2019-09-16 17:04:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:04:58,642 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:58,643 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:58,643 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1848274964, now seen corresponding path program 1 times [2019-09-16 17:04:58,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:58,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:58,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:58,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:58,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:58,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:58,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:58,723 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2019-09-16 17:04:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:59,192 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2019-09-16 17:04:59,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:59,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:04:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:59,197 INFO L225 Difference]: With dead ends: 537 [2019-09-16 17:04:59,197 INFO L226 Difference]: Without dead ends: 537 [2019-09-16 17:04:59,198 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-16 17:04:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2019-09-16 17:04:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:04:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2019-09-16 17:04:59,215 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2019-09-16 17:04:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:59,215 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2019-09-16 17:04:59,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2019-09-16 17:04:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:04:59,217 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,217 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:59,217 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2132058447, now seen corresponding path program 1 times [2019-09-16 17:04:59,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:59,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:59,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:59,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:59,329 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2019-09-16 17:04:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:59,793 INFO L93 Difference]: Finished difference Result 535 states and 794 transitions. [2019-09-16 17:04:59,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:59,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:04:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:59,797 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:04:59,797 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:04:59,798 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:04:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-16 17:04:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:04:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2019-09-16 17:04:59,811 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2019-09-16 17:04:59,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:59,812 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2019-09-16 17:04:59,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2019-09-16 17:04:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:04:59,819 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,819 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:59,819 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2113402989, now seen corresponding path program 1 times [2019-09-16 17:04:59,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:59,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:59,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:59,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:59,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:59,914 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2019-09-16 17:05:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,372 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2019-09-16 17:05:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:00,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,377 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:00,377 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:00,378 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:00,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-16 17:05:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-09-16 17:05:00,395 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2019-09-16 17:05:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,395 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-09-16 17:05:00,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-09-16 17:05:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:00,399 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,399 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:00,399 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1407902352, now seen corresponding path program 1 times [2019-09-16 17:05:00,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:00,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:00,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:00,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:00,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:00,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:00,485 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-09-16 17:05:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,924 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2019-09-16 17:05:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:00,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,927 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:00,928 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:00,928 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-16 17:05:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2019-09-16 17:05:00,940 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2019-09-16 17:05:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,940 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2019-09-16 17:05:00,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2019-09-16 17:05:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:00,942 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,943 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:00,943 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,943 INFO L82 PathProgramCache]: Analyzing trace with hash 286691281, now seen corresponding path program 1 times [2019-09-16 17:05:00,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:00,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,052 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2019-09-16 17:05:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,469 INFO L93 Difference]: Finished difference Result 463 states and 681 transitions. [2019-09-16 17:05:01,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,475 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:05:01,475 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:05:01,477 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:05:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-16 17:05:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2019-09-16 17:05:01,490 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2019-09-16 17:05:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,491 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2019-09-16 17:05:01,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2019-09-16 17:05:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:01,494 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,495 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:01,496 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 268035823, now seen corresponding path program 1 times [2019-09-16 17:05:01,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,622 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2019-09-16 17:05:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,948 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2019-09-16 17:05:01,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,952 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:05:01,952 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:05:01,952 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:05:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-16 17:05:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2019-09-16 17:05:01,963 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2019-09-16 17:05:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,964 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2019-09-16 17:05:01,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2019-09-16 17:05:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:01,965 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,966 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:01,966 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,966 INFO L82 PathProgramCache]: Analyzing trace with hash -437464814, now seen corresponding path program 1 times [2019-09-16 17:05:01,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:02,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:02,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:02,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:02,046 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2019-09-16 17:05:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,429 INFO L93 Difference]: Finished difference Result 463 states and 677 transitions. [2019-09-16 17:05:02,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:02,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,432 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:05:02,432 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:05:02,433 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:05:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-16 17:05:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2019-09-16 17:05:02,444 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2019-09-16 17:05:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,445 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2019-09-16 17:05:02,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2019-09-16 17:05:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:02,447 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,447 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:02,447 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1076828074, now seen corresponding path program 1 times [2019-09-16 17:05:02,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:02,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:02,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:02,514 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2019-09-16 17:05:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,970 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2019-09-16 17:05:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:02,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,974 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:02,974 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:02,975 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:02,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-16 17:05:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-09-16 17:05:02,992 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2019-09-16 17:05:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,992 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-09-16 17:05:02,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-09-16 17:05:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:02,995 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,995 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:02,996 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash 979180473, now seen corresponding path program 1 times [2019-09-16 17:05:02,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:03,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,087 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-09-16 17:05:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,649 INFO L93 Difference]: Finished difference Result 529 states and 773 transitions. [2019-09-16 17:05:03,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:03,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,654 INFO L225 Difference]: With dead ends: 529 [2019-09-16 17:05:03,654 INFO L226 Difference]: Without dead ends: 529 [2019-09-16 17:05:03,655 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-16 17:05:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-16 17:05:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2019-09-16 17:05:03,669 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2019-09-16 17:05:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,670 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2019-09-16 17:05:03,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2019-09-16 17:05:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:03,673 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,673 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:03,673 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1846331924, now seen corresponding path program 1 times [2019-09-16 17:05:03,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:03,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,758 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2019-09-16 17:05:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,112 INFO L93 Difference]: Finished difference Result 463 states and 671 transitions. [2019-09-16 17:05:04,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,116 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:05:04,116 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:05:04,116 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:05:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-16 17:05:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2019-09-16 17:05:04,129 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2019-09-16 17:05:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,129 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2019-09-16 17:05:04,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2019-09-16 17:05:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:04,131 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,131 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:04,132 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash -392626825, now seen corresponding path program 1 times [2019-09-16 17:05:04,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:04,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,200 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2019-09-16 17:05:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,545 INFO L93 Difference]: Finished difference Result 457 states and 662 transitions. [2019-09-16 17:05:04,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,550 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:05:04,550 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:05:04,551 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:05:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-16 17:05:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2019-09-16 17:05:04,570 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2019-09-16 17:05:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,571 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2019-09-16 17:05:04,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2019-09-16 17:05:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:04,573 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,573 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:04,574 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,574 INFO L82 PathProgramCache]: Analyzing trace with hash 564256466, now seen corresponding path program 1 times [2019-09-16 17:05:04,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:04,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,655 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2019-09-16 17:05:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,065 INFO L93 Difference]: Finished difference Result 529 states and 767 transitions. [2019-09-16 17:05:05,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,069 INFO L225 Difference]: With dead ends: 529 [2019-09-16 17:05:05,069 INFO L226 Difference]: Without dead ends: 529 [2019-09-16 17:05:05,070 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-16 17:05:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-16 17:05:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2019-09-16 17:05:05,085 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2019-09-16 17:05:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,086 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2019-09-16 17:05:05,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2019-09-16 17:05:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:05,087 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,088 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:05,088 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,089 INFO L82 PathProgramCache]: Analyzing trace with hash 987903188, now seen corresponding path program 1 times [2019-09-16 17:05:05,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:05,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,170 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2019-09-16 17:05:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,467 INFO L93 Difference]: Finished difference Result 457 states and 658 transitions. [2019-09-16 17:05:05,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,470 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:05:05,471 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:05:05,471 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:05:05,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-16 17:05:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2019-09-16 17:05:05,488 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2019-09-16 17:05:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,489 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2019-09-16 17:05:05,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2019-09-16 17:05:05,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:05,494 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,494 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:05,494 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1652269339, now seen corresponding path program 1 times [2019-09-16 17:05:05,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:05,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,577 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2019-09-16 17:05:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,102 INFO L93 Difference]: Finished difference Result 511 states and 741 transitions. [2019-09-16 17:05:06,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,107 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:05:06,108 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:05:06,108 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:05:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-16 17:05:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2019-09-16 17:05:06,126 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2019-09-16 17:05:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,126 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2019-09-16 17:05:06,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2019-09-16 17:05:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:06,129 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,129 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:06,130 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash -39157652, now seen corresponding path program 1 times [2019-09-16 17:05:06,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:06,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,247 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2019-09-16 17:05:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,761 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2019-09-16 17:05:06,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,765 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:05:06,766 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:05:06,766 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:05:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-16 17:05:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2019-09-16 17:05:06,778 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2019-09-16 17:05:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,779 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2019-09-16 17:05:06,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2019-09-16 17:05:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:06,781 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,781 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:06,782 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1900415833, now seen corresponding path program 1 times [2019-09-16 17:05:06,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:06,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,855 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2019-09-16 17:05:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,136 INFO L93 Difference]: Finished difference Result 439 states and 630 transitions. [2019-09-16 17:05:07,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:07,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,141 INFO L225 Difference]: With dead ends: 439 [2019-09-16 17:05:07,141 INFO L226 Difference]: Without dead ends: 439 [2019-09-16 17:05:07,142 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-16 17:05:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2019-09-16 17:05:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:05:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2019-09-16 17:05:07,155 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2019-09-16 17:05:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,156 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2019-09-16 17:05:07,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2019-09-16 17:05:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:07,158 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,159 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:07,159 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash 208988842, now seen corresponding path program 1 times [2019-09-16 17:05:07,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-16 17:05:07,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:07,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:07,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:07,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:07,270 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2019-09-16 17:05:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,311 INFO L93 Difference]: Finished difference Result 574 states and 827 transitions. [2019-09-16 17:05:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:07,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-16 17:05:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,316 INFO L225 Difference]: With dead ends: 574 [2019-09-16 17:05:07,316 INFO L226 Difference]: Without dead ends: 574 [2019-09-16 17:05:07,317 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-16 17:05:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-16 17:05:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-16 17:05:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2019-09-16 17:05:07,334 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2019-09-16 17:05:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,334 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2019-09-16 17:05:07,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2019-09-16 17:05:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:07,346 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,346 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:07,347 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1641385280, now seen corresponding path program 1 times [2019-09-16 17:05:07,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-16 17:05:07,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:07,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:07,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:07,433 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2019-09-16 17:05:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,465 INFO L93 Difference]: Finished difference Result 727 states and 1049 transitions. [2019-09-16 17:05:07,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:07,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-16 17:05:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,469 INFO L225 Difference]: With dead ends: 727 [2019-09-16 17:05:07,469 INFO L226 Difference]: Without dead ends: 727 [2019-09-16 17:05:07,471 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-16 17:05:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-16 17:05:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-16 17:05:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2019-09-16 17:05:07,487 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2019-09-16 17:05:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,487 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2019-09-16 17:05:07,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2019-09-16 17:05:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:07,489 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,489 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:07,490 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1283662913, now seen corresponding path program 1 times [2019-09-16 17:05:07,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:07,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:07,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:07,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:07,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:07,586 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2019-09-16 17:05:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,606 INFO L93 Difference]: Finished difference Result 727 states and 1048 transitions. [2019-09-16 17:05:07,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:07,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-16 17:05:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,611 INFO L225 Difference]: With dead ends: 727 [2019-09-16 17:05:07,611 INFO L226 Difference]: Without dead ends: 727 [2019-09-16 17:05:07,611 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:07,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-16 17:05:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-16 17:05:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-16 17:05:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1048 transitions. [2019-09-16 17:05:07,627 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1048 transitions. Word has length 104 [2019-09-16 17:05:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,627 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1048 transitions. [2019-09-16 17:05:07,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1048 transitions. [2019-09-16 17:05:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:05:07,630 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,630 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:07,630 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 803234748, now seen corresponding path program 1 times [2019-09-16 17:05:07,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:07,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:07,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:07,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:07,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:07,721 INFO L87 Difference]: Start difference. First operand 727 states and 1048 transitions. Second operand 4 states. [2019-09-16 17:05:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,040 INFO L93 Difference]: Finished difference Result 984 states and 1425 transitions. [2019-09-16 17:05:08,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:05:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,046 INFO L225 Difference]: With dead ends: 984 [2019-09-16 17:05:08,047 INFO L226 Difference]: Without dead ends: 984 [2019-09-16 17:05:08,047 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-09-16 17:05:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 847. [2019-09-16 17:05:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-09-16 17:05:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1258 transitions. [2019-09-16 17:05:08,069 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1258 transitions. Word has length 106 [2019-09-16 17:05:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,069 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1258 transitions. [2019-09-16 17:05:08,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1258 transitions. [2019-09-16 17:05:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:05:08,072 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,072 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:08,073 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash -876635477, now seen corresponding path program 1 times [2019-09-16 17:05:08,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:08,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:08,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:08,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:08,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:08,209 INFO L87 Difference]: Start difference. First operand 847 states and 1258 transitions. Second operand 4 states. [2019-09-16 17:05:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,506 INFO L93 Difference]: Finished difference Result 979 states and 1415 transitions. [2019-09-16 17:05:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:05:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,512 INFO L225 Difference]: With dead ends: 979 [2019-09-16 17:05:08,513 INFO L226 Difference]: Without dead ends: 979 [2019-09-16 17:05:08,513 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-16 17:05:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 847. [2019-09-16 17:05:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-09-16 17:05:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1253 transitions. [2019-09-16 17:05:08,534 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1253 transitions. Word has length 121 [2019-09-16 17:05:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,534 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1253 transitions. [2019-09-16 17:05:08,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1253 transitions. [2019-09-16 17:05:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:05:08,537 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,537 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:08,538 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1624661431, now seen corresponding path program 1 times [2019-09-16 17:05:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:08,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:08,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:08,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:08,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:08,622 INFO L87 Difference]: Start difference. First operand 847 states and 1253 transitions. Second operand 4 states. [2019-09-16 17:05:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,943 INFO L93 Difference]: Finished difference Result 979 states and 1410 transitions. [2019-09-16 17:05:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:05:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,950 INFO L225 Difference]: With dead ends: 979 [2019-09-16 17:05:08,950 INFO L226 Difference]: Without dead ends: 979 [2019-09-16 17:05:08,950 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-16 17:05:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 847. [2019-09-16 17:05:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-09-16 17:05:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1248 transitions. [2019-09-16 17:05:08,973 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1248 transitions. Word has length 121 [2019-09-16 17:05:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,973 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1248 transitions. [2019-09-16 17:05:08,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1248 transitions. [2019-09-16 17:05:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:05:08,976 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,977 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:08,977 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1005940820, now seen corresponding path program 1 times [2019-09-16 17:05:08,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:05:09,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:09,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:09,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:09,061 INFO L87 Difference]: Start difference. First operand 847 states and 1248 transitions. Second operand 4 states. [2019-09-16 17:05:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,330 INFO L93 Difference]: Finished difference Result 985 states and 1451 transitions. [2019-09-16 17:05:09,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:09,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:05:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,340 INFO L225 Difference]: With dead ends: 985 [2019-09-16 17:05:09,340 INFO L226 Difference]: Without dead ends: 985 [2019-09-16 17:05:09,342 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-09-16 17:05:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 919. [2019-09-16 17:05:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-16 17:05:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1368 transitions. [2019-09-16 17:05:09,372 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1368 transitions. Word has length 121 [2019-09-16 17:05:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:09,373 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1368 transitions. [2019-09-16 17:05:09,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1368 transitions. [2019-09-16 17:05:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-16 17:05:09,376 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:09,376 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:09,376 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash 908942672, now seen corresponding path program 1 times [2019-09-16 17:05:09,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:09,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:09,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:09,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:09,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:09,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:09,470 INFO L87 Difference]: Start difference. First operand 919 states and 1368 transitions. Second operand 4 states. [2019-09-16 17:05:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,782 INFO L93 Difference]: Finished difference Result 1051 states and 1525 transitions. [2019-09-16 17:05:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:09,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-16 17:05:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,789 INFO L225 Difference]: With dead ends: 1051 [2019-09-16 17:05:09,789 INFO L226 Difference]: Without dead ends: 1051 [2019-09-16 17:05:09,790 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-09-16 17:05:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 919. [2019-09-16 17:05:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-16 17:05:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1363 transitions. [2019-09-16 17:05:09,812 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1363 transitions. Word has length 122 [2019-09-16 17:05:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:09,812 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1363 transitions. [2019-09-16 17:05:09,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1363 transitions. [2019-09-16 17:05:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 17:05:09,815 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:09,815 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:09,815 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:09,816 INFO L82 PathProgramCache]: Analyzing trace with hash -187191506, now seen corresponding path program 1 times [2019-09-16 17:05:09,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:09,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:09,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:09,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:09,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:09,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:09,901 INFO L87 Difference]: Start difference. First operand 919 states and 1363 transitions. Second operand 4 states. [2019-09-16 17:05:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:10,265 INFO L93 Difference]: Finished difference Result 1051 states and 1520 transitions. [2019-09-16 17:05:10,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:10,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-16 17:05:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:10,272 INFO L225 Difference]: With dead ends: 1051 [2019-09-16 17:05:10,272 INFO L226 Difference]: Without dead ends: 1051 [2019-09-16 17:05:10,273 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-09-16 17:05:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 919. [2019-09-16 17:05:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-16 17:05:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1358 transitions. [2019-09-16 17:05:10,294 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1358 transitions. Word has length 123 [2019-09-16 17:05:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:10,294 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1358 transitions. [2019-09-16 17:05:10,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1358 transitions. [2019-09-16 17:05:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-16 17:05:10,297 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:10,298 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:10,298 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2136062699, now seen corresponding path program 1 times [2019-09-16 17:05:10,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:10,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:10,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:10,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,445 INFO L87 Difference]: Start difference. First operand 919 states and 1358 transitions. Second operand 4 states. [2019-09-16 17:05:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:10,741 INFO L93 Difference]: Finished difference Result 1006 states and 1460 transitions. [2019-09-16 17:05:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:10,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-16 17:05:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:10,749 INFO L225 Difference]: With dead ends: 1006 [2019-09-16 17:05:10,749 INFO L226 Difference]: Without dead ends: 1006 [2019-09-16 17:05:10,751 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-09-16 17:05:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 919. [2019-09-16 17:05:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-16 17:05:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1353 transitions. [2019-09-16 17:05:10,777 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1353 transitions. Word has length 124 [2019-09-16 17:05:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:10,777 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1353 transitions. [2019-09-16 17:05:10,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1353 transitions. [2019-09-16 17:05:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-16 17:05:10,782 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:10,782 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:10,782 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:10,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:10,783 INFO L82 PathProgramCache]: Analyzing trace with hash 195204134, now seen corresponding path program 1 times [2019-09-16 17:05:10,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:10,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:10,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-16 17:05:10,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,904 INFO L87 Difference]: Start difference. First operand 919 states and 1353 transitions. Second operand 4 states. [2019-09-16 17:05:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:11,197 INFO L93 Difference]: Finished difference Result 1151 states and 1695 transitions. [2019-09-16 17:05:11,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:11,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-16 17:05:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:11,203 INFO L225 Difference]: With dead ends: 1151 [2019-09-16 17:05:11,204 INFO L226 Difference]: Without dead ends: 1151 [2019-09-16 17:05:11,205 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-16 17:05:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1029. [2019-09-16 17:05:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-09-16 17:05:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1543 transitions. [2019-09-16 17:05:11,227 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1543 transitions. Word has length 124 [2019-09-16 17:05:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:11,227 INFO L475 AbstractCegarLoop]: Abstraction has 1029 states and 1543 transitions. [2019-09-16 17:05:11,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1543 transitions. [2019-09-16 17:05:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-16 17:05:11,235 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:11,236 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:11,236 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:11,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1476839352, now seen corresponding path program 1 times [2019-09-16 17:05:11,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-16 17:05:11,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:11,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:11,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:11,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:11,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:11,381 INFO L87 Difference]: Start difference. First operand 1029 states and 1543 transitions. Second operand 6 states. [2019-09-16 17:05:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:11,967 INFO L93 Difference]: Finished difference Result 1113 states and 1665 transitions. [2019-09-16 17:05:11,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:11,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-16 17:05:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:11,972 INFO L225 Difference]: With dead ends: 1113 [2019-09-16 17:05:11,973 INFO L226 Difference]: Without dead ends: 1113 [2019-09-16 17:05:11,973 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:05:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-16 17:05:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1037. [2019-09-16 17:05:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-09-16 17:05:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1556 transitions. [2019-09-16 17:05:11,992 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1556 transitions. Word has length 128 [2019-09-16 17:05:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:11,993 INFO L475 AbstractCegarLoop]: Abstraction has 1037 states and 1556 transitions. [2019-09-16 17:05:11,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1556 transitions. [2019-09-16 17:05:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-16 17:05:11,997 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:11,997 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-09-16 17:05:11,997 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:11,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1283532057, now seen corresponding path program 1 times [2019-09-16 17:05:11,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-16 17:05:12,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:12,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:12,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:12,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:12,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:12,118 INFO L87 Difference]: Start difference. First operand 1037 states and 1556 transitions. Second operand 6 states. [2019-09-16 17:05:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,614 INFO L93 Difference]: Finished difference Result 1110 states and 1661 transitions. [2019-09-16 17:05:12,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:12,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-16 17:05:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,620 INFO L225 Difference]: With dead ends: 1110 [2019-09-16 17:05:12,620 INFO L226 Difference]: Without dead ends: 1110 [2019-09-16 17:05:12,621 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:05:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-09-16 17:05:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1038. [2019-09-16 17:05:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2019-09-16 17:05:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1557 transitions. [2019-09-16 17:05:12,663 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1557 transitions. Word has length 129 [2019-09-16 17:05:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,664 INFO L475 AbstractCegarLoop]: Abstraction has 1038 states and 1557 transitions. [2019-09-16 17:05:12,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1557 transitions. [2019-09-16 17:05:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-16 17:05:12,667 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,667 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:12,668 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash -602359811, now seen corresponding path program 1 times [2019-09-16 17:05:12,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:05:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:05:13,321 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-16 17:05:13,371 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-16 17:05:13,373 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20487 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-16 17:05:13,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:13 BoogieIcfgContainer [2019-09-16 17:05:13,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:13,478 INFO L168 Benchmark]: Toolchain (without parser) took 21043.04 ms. Allocated memory was 130.5 MB in the beginning and 526.9 MB in the end (delta: 396.4 MB). Free memory was 83.6 MB in the beginning and 303.3 MB in the end (delta: -219.7 MB). Peak memory consumption was 176.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,479 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 130.5 MB. Free memory was 104.6 MB in the beginning and 104.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.73 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.4 MB in the beginning and 154.6 MB in the end (delta: -71.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,480 INFO L168 Benchmark]: Boogie Preprocessor took 181.97 ms. Allocated memory is still 198.7 MB. Free memory was 154.6 MB in the beginning and 147.2 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,481 INFO L168 Benchmark]: RCFGBuilder took 1505.62 ms. Allocated memory was 198.7 MB in the beginning and 218.1 MB in the end (delta: 19.4 MB). Free memory was 147.2 MB in the beginning and 170.5 MB in the end (delta: -23.3 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,481 INFO L168 Benchmark]: TraceAbstraction took 18510.89 ms. Allocated memory was 218.1 MB in the beginning and 526.9 MB in the end (delta: 308.8 MB). Free memory was 170.5 MB in the beginning and 303.3 MB in the end (delta: -132.8 MB). Peak memory consumption was 176.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,485 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 130.5 MB. Free memory was 104.6 MB in the beginning and 104.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 839.73 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.4 MB in the beginning and 154.6 MB in the end (delta: -71.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 181.97 ms. Allocated memory is still 198.7 MB. Free memory was 154.6 MB in the beginning and 147.2 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1505.62 ms. Allocated memory was 198.7 MB in the beginning and 218.1 MB in the end (delta: 19.4 MB). Free memory was 147.2 MB in the beginning and 170.5 MB in the end (delta: -23.3 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18510.89 ms. Allocated memory was 218.1 MB in the beginning and 526.9 MB in the end (delta: 308.8 MB). Free memory was 170.5 MB in the beginning and 303.3 MB in the end (delta: -132.8 MB). Peak memory consumption was 176.0 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 20487 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: 1646]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1331. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20531, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-4:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={-1:0}, SSLv3_client_data={-4:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] *tmp___0 = 0 [L1111] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->info_callback={-4294967301:6}, skip=0, SSLv3_client_data={-4:0}, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=12292, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1250] EXPR s->version VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->version=2, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->init_buf={4:-3}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4368, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->bbio={2:1}, s->wbio={2:-1}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4384, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->hit=0, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1327] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4400, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={-4294967301:6}, ((s->s3)->tmp.new_cipher)->algorithms=20528, (s->s3)->tmp.new_cipher={20521:2}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1340] COND FALSE !(ret <= 0) VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4416, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4432, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4448, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=2, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1646] __VERIFIER_error() VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=2, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 169 locations, 1 error locations. UNSAFE Result, 18.4s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7485 SDtfs, 3047 SDslu, 9993 SDs, 0 SdLazy, 5723 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 70 SyntacticMatches, 22 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1038occurred in iteration=35, 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.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 2754 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3213 NumberOfCodeBlocks, 3213 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3035 ConstructedInterpolants, 0 QuantifiedInterpolants, 683183 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 2861/2861 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...