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.03.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:05,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:05,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:05,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:05,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:05,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:05,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:05,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:05,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:05,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:05,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:05,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:05,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:05,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:05,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:05,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:05,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:05,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:05,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:05,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:05,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:05,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:05,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:05,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:05,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:05,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:05,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:05,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:05,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:05,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:05,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:05,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:05,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:05,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:05,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:05,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:05,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:05,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:05,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:05,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:05,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:05,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:05,443 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:05,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:05,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:05,444 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:05,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:05,445 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:05,445 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:05,446 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:05,446 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:05,446 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:05,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:05,447 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:05,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:05,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:05,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:05,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:05,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:05,448 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:05,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:05,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:05,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:05,449 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:05,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:05,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:05,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:05,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:05,450 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:05,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:05,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:05,451 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:05,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:05,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:05,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:05,498 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:05,499 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:05,499 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-1.c [2019-09-20 13:27:05,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8ed46da/6a4450efc62b494a977c8a7683bccf84/FLAG53eeb286a [2019-09-20 13:27:06,173 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:06,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-1.c [2019-09-20 13:27:06,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8ed46da/6a4450efc62b494a977c8a7683bccf84/FLAG53eeb286a [2019-09-20 13:27:06,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8ed46da/6a4450efc62b494a977c8a7683bccf84 [2019-09-20 13:27:06,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:06,458 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:06,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:06,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:06,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:06,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:06" (1/1) ... [2019-09-20 13:27:06,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6f752c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:06, skipping insertion in model container [2019-09-20 13:27:06,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:06" (1/1) ... [2019-09-20 13:27:06,480 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:06,561 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:07,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:07,161 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:07,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:07,441 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:07,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07 WrapperNode [2019-09-20 13:27:07,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:07,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:07,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:07,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:07,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07" (1/1) ... [2019-09-20 13:27:07,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07" (1/1) ... [2019-09-20 13:27:07,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07" (1/1) ... [2019-09-20 13:27:07,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07" (1/1) ... [2019-09-20 13:27:07,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07" (1/1) ... [2019-09-20 13:27:07,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07" (1/1) ... [2019-09-20 13:27:07,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07" (1/1) ... [2019-09-20 13:27:07,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:07,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:07,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:07,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:07,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:07,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-20 13:27:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-20 13:27:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-20 13:27:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-20 13:27:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-20 13:27:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-20 13:27:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:08,256 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:08,874 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-20 13:27:08,875 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-20 13:27:08,898 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:08,898 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:08,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:08 BoogieIcfgContainer [2019-09-20 13:27:08,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:08,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:08,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:08,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:08,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:06" (1/3) ... [2019-09-20 13:27:08,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2177f99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:08, skipping insertion in model container [2019-09-20 13:27:08,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:07" (2/3) ... [2019-09-20 13:27:08,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2177f99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:08, skipping insertion in model container [2019-09-20 13:27:08,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:08" (3/3) ... [2019-09-20 13:27:08,909 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-09-20 13:27:08,919 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:08,927 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:08,945 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:08,973 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:08,973 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:08,973 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:08,973 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:08,973 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:08,973 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:08,974 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:08,974 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-20 13:27:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:27:09,004 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,006 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:09,008 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-20 13:27:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:09,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:09,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:09,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:09,385 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-20 13:27:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,498 INFO L93 Difference]: Finished difference Result 254 states and 414 transitions. [2019-09-20 13:27:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:09,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:27:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,515 INFO L225 Difference]: With dead ends: 254 [2019-09-20 13:27:09,516 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:27:09,518 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:27:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-09-20 13:27:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-20 13:27:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-20 13:27:09,584 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2019-09-20 13:27:09,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,584 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-20 13:27:09,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-20 13:27:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:27:09,588 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,588 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:09,589 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash -147745042, now seen corresponding path program 1 times [2019-09-20 13:27:09,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:09,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:09,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:09,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:09,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:09,805 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2019-09-20 13:27:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,860 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-20 13:27:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:09,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:27:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,864 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:27:09,864 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:27:09,865 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:27:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-09-20 13:27:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-20 13:27:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2019-09-20 13:27:09,885 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2019-09-20 13:27:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,886 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2019-09-20 13:27:09,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2019-09-20 13:27:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:09,890 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,890 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:09,890 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash -592195955, now seen corresponding path program 1 times [2019-09-20 13:27:09,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:10,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:10,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:10,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:10,077 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2019-09-20 13:27:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,659 INFO L93 Difference]: Finished difference Result 504 states and 746 transitions. [2019-09-20 13:27:10,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:10,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,663 INFO L225 Difference]: With dead ends: 504 [2019-09-20 13:27:10,664 INFO L226 Difference]: Without dead ends: 504 [2019-09-20 13:27:10,664 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-20 13:27:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 368. [2019-09-20 13:27:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-20 13:27:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2019-09-20 13:27:10,682 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2019-09-20 13:27:10,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,683 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2019-09-20 13:27:10,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2019-09-20 13:27:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:10,687 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,688 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,688 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash -726209461, now seen corresponding path program 1 times [2019-09-20 13:27:10,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:10,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:10,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:10,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:10,809 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2019-09-20 13:27:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,153 INFO L93 Difference]: Finished difference Result 454 states and 681 transitions. [2019-09-20 13:27:11,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,160 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:11,160 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:11,161 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 408. [2019-09-20 13:27:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-20 13:27:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-20 13:27:11,179 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2019-09-20 13:27:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,183 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-20 13:27:11,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-20 13:27:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:11,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,195 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,195 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1182891182, now seen corresponding path program 1 times [2019-09-20 13:27:11,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:11,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,308 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-09-20 13:27:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,778 INFO L93 Difference]: Finished difference Result 536 states and 804 transitions. [2019-09-20 13:27:11,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:11,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,787 INFO L225 Difference]: With dead ends: 536 [2019-09-20 13:27:11,787 INFO L226 Difference]: Without dead ends: 536 [2019-09-20 13:27:11,788 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-20 13:27:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 410. [2019-09-20 13:27:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2019-09-20 13:27:11,801 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2019-09-20 13:27:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,802 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2019-09-20 13:27:11,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2019-09-20 13:27:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:11,804 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,804 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,805 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1433744923, now seen corresponding path program 1 times [2019-09-20 13:27:11,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:11,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,953 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2019-09-20 13:27:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,440 INFO L93 Difference]: Finished difference Result 534 states and 800 transitions. [2019-09-20 13:27:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,448 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:12,448 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:12,448 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2019-09-20 13:27:12,460 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2019-09-20 13:27:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,461 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2019-09-20 13:27:12,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2019-09-20 13:27:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:12,463 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,463 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:12,464 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1752241927, now seen corresponding path program 1 times [2019-09-20 13:27:12,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:12,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,559 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2019-09-20 13:27:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,988 INFO L93 Difference]: Finished difference Result 534 states and 798 transitions. [2019-09-20 13:27:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,991 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:12,992 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:12,992 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2019-09-20 13:27:13,003 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2019-09-20 13:27:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,003 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2019-09-20 13:27:13,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2019-09-20 13:27:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:13,005 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,005 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:13,005 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1831863075, now seen corresponding path program 1 times [2019-09-20 13:27:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:13,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,090 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2019-09-20 13:27:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,366 INFO L93 Difference]: Finished difference Result 454 states and 675 transitions. [2019-09-20 13:27:13,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:13,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,373 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:13,374 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:13,374 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2019-09-20 13:27:13,384 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2019-09-20 13:27:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,385 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2019-09-20 13:27:13,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2019-09-20 13:27:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:27:13,386 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,387 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:13,387 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash 722882629, now seen corresponding path program 1 times [2019-09-20 13:27:13,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:13,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,451 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2019-09-20 13:27:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,746 INFO L93 Difference]: Finished difference Result 454 states and 673 transitions. [2019-09-20 13:27:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:27:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,750 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:13,750 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:13,751 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-09-20 13:27:13,763 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2019-09-20 13:27:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,763 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-09-20 13:27:13,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-09-20 13:27:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:13,765 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,765 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:13,765 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1460682036, now seen corresponding path program 1 times [2019-09-20 13:27:13,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:13,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,848 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-09-20 13:27:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,286 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2019-09-20 13:27:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,293 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:14,293 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:14,294 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-09-20 13:27:14,305 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2019-09-20 13:27:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,305 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-09-20 13:27:14,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-09-20 13:27:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:14,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,307 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-20 13:27:14,308 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1160620953, now seen corresponding path program 1 times [2019-09-20 13:27:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:14,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,391 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-09-20 13:27:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,881 INFO L93 Difference]: Finished difference Result 534 states and 790 transitions. [2019-09-20 13:27:14,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,887 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:14,887 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:14,887 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2019-09-20 13:27:14,898 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2019-09-20 13:27:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,899 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2019-09-20 13:27:14,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2019-09-20 13:27:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:14,900 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,901 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:14,901 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,901 INFO L82 PathProgramCache]: Analyzing trace with hash 988918094, now seen corresponding path program 1 times [2019-09-20 13:27:14,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:14,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,973 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2019-09-20 13:27:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,269 INFO L93 Difference]: Finished difference Result 454 states and 667 transitions. [2019-09-20 13:27:15,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,272 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:15,272 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:15,273 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2019-09-20 13:27:15,282 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 78 [2019-09-20 13:27:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,283 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2019-09-20 13:27:15,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2019-09-20 13:27:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:15,284 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,285 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-20 13:27:15,285 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1288979177, now seen corresponding path program 1 times [2019-09-20 13:27:15,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:15,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,357 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 4 states. [2019-09-20 13:27:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,637 INFO L93 Difference]: Finished difference Result 454 states and 665 transitions. [2019-09-20 13:27:15,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,640 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:15,640 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:15,641 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 609 transitions. [2019-09-20 13:27:15,650 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 609 transitions. Word has length 78 [2019-09-20 13:27:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,651 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 609 transitions. [2019-09-20 13:27:15,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 609 transitions. [2019-09-20 13:27:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:15,652 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,653 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:15,653 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2074470850, now seen corresponding path program 1 times [2019-09-20 13:27:15,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:15,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,712 INFO L87 Difference]: Start difference. First operand 410 states and 609 transitions. Second operand 4 states. [2019-09-20 13:27:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,178 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2019-09-20 13:27:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:16,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,182 INFO L225 Difference]: With dead ends: 534 [2019-09-20 13:27:16,182 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:27:16,183 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:27:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-20 13:27:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 607 transitions. [2019-09-20 13:27:16,193 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 607 transitions. Word has length 79 [2019-09-20 13:27:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,194 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 607 transitions. [2019-09-20 13:27:16,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 607 transitions. [2019-09-20 13:27:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:16,195 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,195 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-20 13:27:16,197 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash 784493186, now seen corresponding path program 1 times [2019-09-20 13:27:16,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:16,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:16,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:16,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:16,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:16,283 INFO L87 Difference]: Start difference. First operand 410 states and 607 transitions. Second operand 4 states. [2019-09-20 13:27:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,767 INFO L93 Difference]: Finished difference Result 528 states and 775 transitions. [2019-09-20 13:27:16,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:16,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,770 INFO L225 Difference]: With dead ends: 528 [2019-09-20 13:27:16,770 INFO L226 Difference]: Without dead ends: 528 [2019-09-20 13:27:16,771 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-20 13:27:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 410. [2019-09-20 13:27:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2019-09-20 13:27:16,780 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 79 [2019-09-20 13:27:16,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,780 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2019-09-20 13:27:16,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2019-09-20 13:27:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:16,782 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,782 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:16,782 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash 702663552, now seen corresponding path program 1 times [2019-09-20 13:27:16,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:16,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:16,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:16,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:16,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:16,849 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 4 states. [2019-09-20 13:27:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,202 INFO L93 Difference]: Finished difference Result 454 states and 659 transitions. [2019-09-20 13:27:17,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,206 INFO L225 Difference]: With dead ends: 454 [2019-09-20 13:27:17,206 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:27:17,207 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:27:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-20 13:27:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 603 transitions. [2019-09-20 13:27:17,219 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 603 transitions. Word has length 79 [2019-09-20 13:27:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,220 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 603 transitions. [2019-09-20 13:27:17,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 603 transitions. [2019-09-20 13:27:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:17,223 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,223 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-20 13:27:17,223 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash -587314112, now seen corresponding path program 1 times [2019-09-20 13:27:17,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:17,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,351 INFO L87 Difference]: Start difference. First operand 410 states and 603 transitions. Second operand 4 states. [2019-09-20 13:27:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,728 INFO L93 Difference]: Finished difference Result 448 states and 650 transitions. [2019-09-20 13:27:17,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,732 INFO L225 Difference]: With dead ends: 448 [2019-09-20 13:27:17,732 INFO L226 Difference]: Without dead ends: 448 [2019-09-20 13:27:17,732 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-20 13:27:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2019-09-20 13:27:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 601 transitions. [2019-09-20 13:27:17,741 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 601 transitions. Word has length 79 [2019-09-20 13:27:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,742 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 601 transitions. [2019-09-20 13:27:17,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2019-09-20 13:27:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:17,744 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,745 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] [2019-09-20 13:27:17,745 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash 51641255, now seen corresponding path program 1 times [2019-09-20 13:27:17,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,832 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-20 13:27:17,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,834 INFO L87 Difference]: Start difference. First operand 410 states and 601 transitions. Second operand 4 states. [2019-09-20 13:27:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,221 INFO L93 Difference]: Finished difference Result 510 states and 747 transitions. [2019-09-20 13:27:18,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,225 INFO L225 Difference]: With dead ends: 510 [2019-09-20 13:27:18,226 INFO L226 Difference]: Without dead ends: 510 [2019-09-20 13:27:18,226 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-20 13:27:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-20 13:27:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 599 transitions. [2019-09-20 13:27:18,235 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 599 transitions. Word has length 80 [2019-09-20 13:27:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,235 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 599 transitions. [2019-09-20 13:27:18,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2019-09-20 13:27:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:18,237 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,237 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] [2019-09-20 13:27:18,237 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash 475287977, now seen corresponding path program 1 times [2019-09-20 13:27:18,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,299 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-20 13:27:18,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,301 INFO L87 Difference]: Start difference. First operand 410 states and 599 transitions. Second operand 4 states. [2019-09-20 13:27:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,606 INFO L93 Difference]: Finished difference Result 430 states and 624 transitions. [2019-09-20 13:27:18,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,611 INFO L225 Difference]: With dead ends: 430 [2019-09-20 13:27:18,611 INFO L226 Difference]: Without dead ends: 430 [2019-09-20 13:27:18,612 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-20 13:27:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 410. [2019-09-20 13:27:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2019-09-20 13:27:18,664 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 80 [2019-09-20 13:27:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,665 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2019-09-20 13:27:18,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2019-09-20 13:27:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:18,667 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,667 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-20 13:27:18,667 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash 643036702, now seen corresponding path program 1 times [2019-09-20 13:27:18,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:27:18,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,742 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand 4 states. [2019-09-20 13:27:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,118 INFO L93 Difference]: Finished difference Result 510 states and 743 transitions. [2019-09-20 13:27:19,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,122 INFO L225 Difference]: With dead ends: 510 [2019-09-20 13:27:19,122 INFO L226 Difference]: Without dead ends: 510 [2019-09-20 13:27:19,123 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-20 13:27:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-20 13:27:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-20 13:27:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 595 transitions. [2019-09-20 13:27:19,131 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 595 transitions. Word has length 81 [2019-09-20 13:27:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,131 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 595 transitions. [2019-09-20 13:27:19,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 595 transitions. [2019-09-20 13:27:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:19,133 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,133 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-20 13:27:19,133 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash 891183196, now seen corresponding path program 1 times [2019-09-20 13:27:19,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,196 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-20 13:27:19,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:19,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:19,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:19,198 INFO L87 Difference]: Start difference. First operand 410 states and 595 transitions. Second operand 3 states. [2019-09-20 13:27:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,227 INFO L93 Difference]: Finished difference Result 559 states and 812 transitions. [2019-09-20 13:27:19,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:19,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-20 13:27:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,230 INFO L225 Difference]: With dead ends: 559 [2019-09-20 13:27:19,230 INFO L226 Difference]: Without dead ends: 559 [2019-09-20 13:27:19,230 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-20 13:27:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-20 13:27:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-20 13:27:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 812 transitions. [2019-09-20 13:27:19,241 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 812 transitions. Word has length 81 [2019-09-20 13:27:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,241 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 812 transitions. [2019-09-20 13:27:19,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 812 transitions. [2019-09-20 13:27:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:19,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,243 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:19,243 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash 363210002, now seen corresponding path program 1 times [2019-09-20 13:27:19,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-20 13:27:19,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:19,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:19,294 INFO L87 Difference]: Start difference. First operand 559 states and 812 transitions. Second operand 3 states. [2019-09-20 13:27:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,324 INFO L93 Difference]: Finished difference Result 708 states and 1030 transitions. [2019-09-20 13:27:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:19,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-20 13:27:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,328 INFO L225 Difference]: With dead ends: 708 [2019-09-20 13:27:19,328 INFO L226 Difference]: Without dead ends: 708 [2019-09-20 13:27:19,328 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-20 13:27:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-09-20 13:27:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-20 13:27:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1030 transitions. [2019-09-20 13:27:19,341 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1030 transitions. Word has length 83 [2019-09-20 13:27:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,341 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1030 transitions. [2019-09-20 13:27:19,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1030 transitions. [2019-09-20 13:27:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:19,344 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,344 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:19,344 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1857235727, now seen corresponding path program 1 times [2019-09-20 13:27:19,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:27:19,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:27:19,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:27:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:27:19,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:27:19,457 INFO L87 Difference]: Start difference. First operand 708 states and 1030 transitions. Second operand 6 states. [2019-09-20 13:27:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,988 INFO L93 Difference]: Finished difference Result 791 states and 1151 transitions. [2019-09-20 13:27:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:19,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-09-20 13:27:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,994 INFO L225 Difference]: With dead ends: 791 [2019-09-20 13:27:19,994 INFO L226 Difference]: Without dead ends: 791 [2019-09-20 13:27:19,994 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-20 13:27:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-20 13:27:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 716. [2019-09-20 13:27:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-20 13:27:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1043 transitions. [2019-09-20 13:27:20,007 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1043 transitions. Word has length 104 [2019-09-20 13:27:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,007 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 1043 transitions. [2019-09-20 13:27:20,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:27:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1043 transitions. [2019-09-20 13:27:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:20,010 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,010 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,010 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1303361832, now seen corresponding path program 1 times [2019-09-20 13:27:20,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:27:20,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:27:20,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:27:20,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:27:20,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:27:20,112 INFO L87 Difference]: Start difference. First operand 716 states and 1043 transitions. Second operand 6 states. [2019-09-20 13:27:20,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,616 INFO L93 Difference]: Finished difference Result 788 states and 1147 transitions. [2019-09-20 13:27:20,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:20,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-20 13:27:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,621 INFO L225 Difference]: With dead ends: 788 [2019-09-20 13:27:20,621 INFO L226 Difference]: Without dead ends: 788 [2019-09-20 13:27:20,622 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-20 13:27:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-20 13:27:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 717. [2019-09-20 13:27:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-20 13:27:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1044 transitions. [2019-09-20 13:27:20,635 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1044 transitions. Word has length 105 [2019-09-20 13:27:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,635 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1044 transitions. [2019-09-20 13:27:20,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:27:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1044 transitions. [2019-09-20 13:27:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-20 13:27:20,638 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,638 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] [2019-09-20 13:27:20,638 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1198210569, now seen corresponding path program 1 times [2019-09-20 13:27:20,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:21,145 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 13:27:21,189 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967306 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-20 13:27:21,190 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967310 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-20 13:27:21,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:21 BoogieIcfgContainer [2019-09-20 13:27:21,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:21,270 INFO L168 Benchmark]: Toolchain (without parser) took 14813.71 ms. Allocated memory was 132.1 MB in the beginning and 432.0 MB in the end (delta: 299.9 MB). Free memory was 85.9 MB in the beginning and 223.7 MB in the end (delta: -137.9 MB). Peak memory consumption was 162.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,271 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 980.09 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 85.4 MB in the beginning and 155.7 MB in the end (delta: -70.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,273 INFO L168 Benchmark]: Boogie Preprocessor took 188.83 ms. Allocated memory is still 199.8 MB. Free memory was 155.7 MB in the beginning and 148.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,274 INFO L168 Benchmark]: RCFGBuilder took 1261.77 ms. Allocated memory was 199.8 MB in the beginning and 222.3 MB in the end (delta: 22.5 MB). Free memory was 148.4 MB in the beginning and 169.7 MB in the end (delta: -21.4 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,274 INFO L168 Benchmark]: TraceAbstraction took 12366.50 ms. Allocated memory was 222.3 MB in the beginning and 432.0 MB in the end (delta: 209.7 MB). Free memory was 168.4 MB in the beginning and 223.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,278 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 980.09 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 85.4 MB in the beginning and 155.7 MB in the end (delta: -70.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 188.83 ms. Allocated memory is still 199.8 MB. Free memory was 155.7 MB in the beginning and 148.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1261.77 ms. Allocated memory was 199.8 MB in the beginning and 222.3 MB in the end (delta: 22.5 MB). Free memory was 148.4 MB in the beginning and 169.7 MB in the end (delta: -21.4 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12366.50 ms. Allocated memory was 222.3 MB in the beginning and 432.0 MB in the end (delta: 209.7 MB). Free memory was 168.4 MB in the beginning and 223.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967306 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 4294967310 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: 1643]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1338. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967334, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-3: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={2:0}, SSLv3_client_data={-3:0}] [L1080] BUF_MEM *buf ; [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 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->info_callback={-4294967301:6}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=12292, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] EXPR s->version VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->version=1, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->init_buf={4294967297:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4368, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->bbio={2:1}, s->wbio={-1:2}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4384, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->hit=0, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1334] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4400, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND TRUE s->state == 4400 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={-4294967301:6}, ((s->s3)->tmp.new_cipher)->algorithms=4294967330, (s->s3)->tmp.new_cipher={4294967317:2}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] blastFlag = 3 VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4416, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4432, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:-796}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [={-4294967301:6}, blastFlag=4, init=1, ret=2, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1643] __VERIFIER_error() VAL [={-4294967301:6}, blastFlag=4, init=1, ret=2, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 167 locations, 1 error locations. UNSAFE Result, 12.3s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5114 SDtfs, 2384 SDslu, 6858 SDs, 0 SdLazy, 4107 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 20 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=717occurred in iteration=24, 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.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1933 NumberOfCodeBlocks, 1933 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1791 ConstructedInterpolants, 0 QuantifiedInterpolants, 397585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 1286/1286 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...